JEA
2008
13 years 4 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
IR
2008
13 years 5 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
IPL
2008
13 years 5 months ago
2008
Abstract. In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied M
IANDC
2006
13 years 5 months ago
2006
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
CG
2007
Springer
13 years 5 months ago
2007
Springer
The winged- and half- edge data structures are commonly used representations for polyhedron models. Due to the complexity, students in an introductory to computer graphics course ...
IJFCS
2008
13 years 5 months ago
2008
We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during ...
CG
2006
Springer
13 years 5 months ago
2006
Springer
We present a combination of techniques for interactive out-of-core visualisation of isosurfaces from large timedependent data sets. We make use of an index tree, computed in a pre...
ENTCS
2008
13 years 5 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of da...