1381 search results - page 73 / 277 » Structural signatures for tree data structures |
101
click to vote
CGF
2004
15 years 3 months ago
2004
In the paper, a new method for modelling trees at medium detail is presented. The method is based on a volumetric representation of trees, generated by an iterated function system...
125
click to vote
IJDAR
2002
15 years 3 months ago
2002
Abstract. In this paper, we present a logical representation for form documents to be used for identification and retrieval. A hierarchical structure is proposed to represent the s...
235
click to vote
VLDB
2005
ACM
16 years 4 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
169
click to vote
ALENEX
2001
15 years 5 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
134
click to vote
ICANN
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we present a system capable of dynamically learning shapes in a way that also allows for the dynamic deletion of shapes already learned. It uses a self-balancing Bin...