Graph theory problem
Dave Smith is looking for an algorithm to get "nodes [that] are the most senior ancestors (speaking in tree terms, of course)" in a directed graph.
All entries tagged "computerscience".
Page 1 of 1
Backus-Naur Form
Backus-Naur Form as defined by Wikipedia:
In computer science, Backus-Naur Form (BNF) is a metasyntax used to express context-free grammars: that is, a formal way to describe formal languages.
BNF is widely used as a notation for the grammars of computer programming languages, instruction sets and communication protocols, as well as a notation for representing parts of natural language grammars.
Painting the Mona Lisa in 50 polygons
Genetic Programming: Evolution of Mona Lisa. Roger Alsing wrote a clever algorithm to express a given bitmap image through a combination of a small number of semi-transparent polygons. He uses a hill climbing approach. Of course, this is far from lossless but the Mona Lisa example is quite impressive. (via kottke)