4342 search results - page 589 / 869 » Improved Algorithms for Optimal Embeddings |
149
click to vote
EVOW
2007
Springer
15 years 11 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
140
click to vote
CSB
2005
IEEE
15 years 11 months ago
2005
IEEE
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
128
click to vote
ICDCIT
2005
Springer
15 years 11 months ago
2005
Springer
An algorithm for time division multiple access (TDMA) is desirable in sensor networks for energy management, as it allows a sensor to reduce the amount of idle listening. Also, TD...
152
click to vote
CC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper presents the design, implementation and experimental evaluation of a practical region-based partial dead code elimination (PDE) algorithm on predicated code in...
129
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...