2899 search results - page 366 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
146
click to vote
EUROCRYPT
2004
Springer
15 years 12 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 ...
208
click to vote
JSAC
2006
15 years 6 months ago
2006
Abstract--Efficient near-optimal energy allocation for multimedia data transmission using multicarrier modulation is investigated. The optimal method typically relies on an iterati...
173
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
209
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
260
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...