18306 search results - page 2934 / 3662 » Algorithmics in Exponential Time |
205
click to vote
NPAR
2004
ACM
16 years 17 days ago
2004
ACM
Algorithms that detect silhouettes, creases, and other edge based features often perform per-edge and per-face mesh computations using global adjacency information. These are unsu...
212
click to vote
SPAA
2004
ACM
16 years 17 days ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
240
click to vote
EMSOFT
2004
Springer
16 years 16 days ago
2004
Springer
In current embedded systems, one of the major concerns is energy conservation. The dynamic voltage-scheduling (DVS) framework, which involves dynamically adjusting the voltage and...
211
click to vote
ESA
2004
Springer
16 years 16 days ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
206
Voted
ICALP
2004
Springer
16 years 16 days ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...