4940 search results - page 43 / 988 » On the Complexity of Universal Programs |
SIGCSE
1999
ACM
15 years 6 months ago
1999
ACM
A Global Cooperation Project was conducted with computer science classes at the Czech Technical University and North Hennepin Community College. The project was a pilot project fo...
104
click to vote
VL
1996
IEEE
15 years 6 months ago
1996
IEEE
An often-mentioned advantage of rule-based programming languages is that a program can be extended simply by adding a few more rules. In practice however, the rules tend to be dep...
141
Voted
UAIS
2010
14 years 8 months ago
2010
Abstract Text documents usually embody visually oriented meta-information in the form of complex visual structures, such as tables. The semantics involved in such objects result in...
63
Voted
IFIP
2010
Springer
15 years 13 days ago
2010
Springer
109
click to vote
CSR
2008
Springer
15 years 3 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...