Sciweavers

Share
JEA
2008
112views more  JEA 2008»
8 years 4 months ago
Dynamic spatial approximation trees
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...
Gonzalo Navarro, Nora Reyes
IR
2008
8 years 4 months ago
A compressed self-index using a Ziv-Lempel dictionary
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...
Luís M. S. Russo, Arlindo L. Oliveira
IPL
2008
87views more  IPL 2008»
8 years 4 months ago
Optimal prefix and suffix queries on texts
Abstract. In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied M
Maxime Crochemore, Costas S. Iliopoulos, Mohammad ...
IANDC
2006
77views more  IANDC 2006»
8 years 4 months ago
Lower and upper bounds on obtaining history independence
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...
Niv Buchbinder, Erez Petrank
CG
2007
Springer
8 years 4 months ago
Visualizing and animating the winged-edge data structure
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 ...
Bryan Neperud, John L. Lowther, Ching-Kuang Shene
IJFCS
2008
110views more  IJFCS 2008»
8 years 4 months ago
Indexing Gapped-Factors Using a Tree
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 ...
Pierre Peterlongo, Julien Allali, Marie-France Sag...
CG
2006
Springer
8 years 4 months ago
Interactive out-of-core isosurface visualisation in time-varying data sets
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...
Benjamin Vrolijk, Frits H. Post
ENTCS
2008
120views more  ENTCS 2008»
8 years 4 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
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...
Alan P. Sexton, Hayo Thielecke
CORR
2008
Springer
74views Education» more  CORR 2008»
8 years 4 months ago
Biased Range Trees
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...
Vida Dujmovic, John Howat, Pat Morin
CORR
2010
Springer
164views Education» more  CORR 2010»
8 years 4 months ago
Random Projection Trees Revisited
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...
Aman Dhesi, Purushottam Kar
books