Sciweavers

184 search results - page 31 / 37
» Cache-oblivious data structures for orthogonal range searchi...
Sort
View
ICDE
2007
IEEE
192views Database» more  ICDE 2007»
14 years 8 months ago
APLA: Indexing Arbitrary Probability Distributions
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
Vebjorn Ljosa, Ambuj K. Singh
ICCSA
2007
Springer
14 years 1 months ago
Weak Visibility of Two Objects in Planar Polygonal Scenes
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi
ICMCS
1999
IEEE
119views Multimedia» more  ICMCS 1999»
13 years 11 months ago
Indexing by Shape of Image Databases Based on Extended Grid Files
In this paper, we propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailo...
Carlo Combi, Gian Luca Foresti, Massimo Francesche...
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
14 years 1 months ago
Compact Similarity Joins
— Similarity joins have attracted significant interest, with applications in Geographical Information Systems, astronomy, marketing analyzes, and anomaly detection. However, all...
Brent Bryan, Frederick Eberhardt, Christos Falouts...
CPM
2005
Springer
101views Combinatorics» more  CPM 2005»
14 years 1 months ago
Succinct Suffix Arrays Based on Run-Length Encoding
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...
Veli Mäkinen, Gonzalo Navarro