141 search results - page 9 / 29 » Supporting Continuous Range Queries in Indoor Space |
92
Voted
COMPGEOM
2003
ACM
15 years 4 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...
203
click to vote
SIGIR
1998
ACM
14 years 11 months ago
1998
ACM
Ranked queries are used to locate relevant documents in text databases. In a ranked query a list of terms is specified, then the documents that most closely match the query are re...
DASFAA
2004
IEEE
15 years 3 months ago
2004
IEEE
Users of database applications, especially in the e-commerce domain, often resort to exploratory "trial-and-error" queries since the underlying data space is huge and unf...
141
Voted
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
82
Voted
SAC
2005
ACM
15 years 5 months ago
2005
ACM
The tuple space model inspired by Linda has recently been rediscovered by distributed middleware. Moreover, some researchers also applied it in the challenging scenarios involving...