Sciweavers

1381 search results - page 73 / 277
» Structural signatures for tree data structures
Sort
View
CGF
2004
111views more  CGF 2004»
14 years 9 months ago
Modeling Trees with Hypertextures
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...
Damjan Strnad, Nikola Guid
IJDAR
2002
87views more  IJDAR 2002»
14 years 9 months ago
A hierarchical representation of form documents for identification and retrieval
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...
Pinar Duygulu, Volkan Atalay
VLDB
2005
ACM
397views Database» more  VLDB 2005»
15 years 10 months ago
Concurrency control and recovery for balanced B-link trees
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 ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
14 years 11 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
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...
Songrit Maneewongvatana, David M. Mount
ICANN
2010
Springer
14 years 8 months ago
Dynamic Shape Learning and Forgetting
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...
Nikolaos Tsapanos, Anastasios Tefas, Ioannis Pitas