69 search results - page 3 / 14 » Merkle Tree Traversal in Log Space and Time |
SODA
2010
ACM
14 years 3 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
ICANN
2010
Springer
13 years 6 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
CCCG
2003
13 years 7 months ago
2003
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for su...
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
SIROCCO
2007
13 years 7 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...