685 search results - page 43 / 137 » Succinct Trees in Practice |
JCB
2002
13 years 7 months ago
2002
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
EUROCRYPT
2004
Springer
14 years 1 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 ...