10988 search results - page 539 / 2198 » Algorithmic Folding Complexity |
195
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
We consider the problem of mapping data in peer-topeer data-sharing systems. Such systems often rely on the use of mapping tables listing pairs of corresponding values to search f...
201
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
192
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
210
click to vote
DATE
2009
IEEE
16 years 2 months ago
2009
IEEE
Current trends in technology scaling foreshadow worsening transistor reliability as well as greater numbers of transistors in each system. The combination of these factors will so...
199
click to vote
INFOCOM
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract—Because the global positioning system (GPS) consumes a large amount of power and does not work indoors, many virtual-coordinate-based routing protocols are proposed for ...