588 search results - page 48 / 118 » Positive higher-order queries |
135
click to vote
DGCI
2000
Springer
15 years 5 months ago
2000
Springer
We consider the problem of finding the best match for a given query shape among candidate shapes stored in a shape base. This is central to a wide range of applications, such as, d...
109
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
203
click to vote
PODS
2009
ACM
16 years 2 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
127
click to vote
GIS
2009
ACM
15 years 8 months ago
2009
ACM
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...
203
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
- The embedding of positioning capabilities in mobile devices and the emergence of location-based applications have created novel opportunities for utilizing several types of multi...