398 search results - page 33 / 80 » Spider Diagrams of Order |
COCOON
2006
Springer
14 years 1 months ago
2006
Springer
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
DEXA
2006
Springer
14 years 1 months ago
2006
Springer
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
AIPS
2003
13 years 11 months ago
2003
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
CIE
2005
Springer
14 years 3 months ago
2005
Springer
geometrical computation: Turing-computing ability and undecidability J´erˆome Durand-Lose Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P...