Sciweavers

736 search results - page 11 / 148
» A dynamic data structure for approximate range searching
Sort
View
VLDB
2005
ACM
124views Database» more  VLDB 2005»
14 years 2 months ago
Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions
In an “uncertain database”, an object o is associated with a multi-dimensional probability density function (pdf), which describes the likelihood that o appears at each positi...
Yufei Tao, Reynold Cheng, Xiaokui Xiao, Wang Kay N...
IPPS
1997
IEEE
14 years 1 months ago
d-Dimensional Range Search on Multicomputers
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...
DCC
2008
IEEE
14 years 8 months ago
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Jeffrey S...
COMPGEOM
2007
ACM
14 years 26 days ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir
BIBE
2003
IEEE
183views Bioinformatics» more  BIBE 2003»
14 years 2 months ago
Effective Indexing and Filtering for Similarity Search in Large Biosequence Databases
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
Ozgur Ozturk, Hakan Ferhatosmanoglu