7648 search results - page 1084 / 1530 » A Data Locality Optimizing Algorithm |
121
Voted
EUROCRYPT
2004
Springer
15 years 10 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 ...
237
click to vote
ICDE
2008
IEEE
16 years 6 months ago
2008
IEEE
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
126
click to vote
CSB
2005
IEEE
15 years 10 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...
156
click to vote
CIMAGING
2008
15 years 6 months ago
2008
We consider the image reconstruction problem when the original image is assumed to be sparse and when partial knowledge of the point spread function (PSF) is available. In particu...
142
click to vote
MOBIDE
2010
ACM
15 years 5 months ago
2010
ACM
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...