4865 search results - page 233 / 973 » The Complexity of Graph Connectivity |
231
Voted
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
155
click to vote
CSR
2009
Springer
15 years 11 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
151
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
154
Voted
SI3D
2003
ACM
15 years 10 months ago
2003
ACM
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
148
click to vote
ICDAR
1995
IEEE
15 years 8 months ago
1995
IEEE
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the dat...