1888 search results - page 131 / 378 » Algorithms for Querying by Spatial Structure |
145
click to vote
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
143
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
126
click to vote
PKDD
2007
Springer
15 years 10 months ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
150
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
182
click to vote
PODS
1999
ACM
15 years 9 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...