Sciweavers

921 search results - page 27 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
213
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
Three problems about dynamic convex hulls
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
Timothy M. Chan
162
Voted
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
15 years 4 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
VLDB
2004
ACM
127views Database» more  VLDB 2004»
16 years 4 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
CIDM
2009
IEEE
15 years 10 months ago
A new hybrid method for Bayesian network learning With dependency constraints
Abstract— A Bayes net has qualitative and quantitative aspects: The qualitative aspect is its graphical structure that corresponds to correlations among the variables in the Baye...
Oliver Schulte, Gustavo Frigo, Russell Greiner, We...
149
Voted
RIAO
2007
15 years 5 months ago
XML Fragments Extended with Database Operators
XML documents represent a middle range between unstructured data such as textual documents and fully structured data encoded in databases. Typically, information retrieval techniq...
Yosi Mass, Dafna Sheinwald, Benjamin Sznajder, Siv...