Sciweavers

588 search results - page 48 / 118
» Positive higher-order queries
Sort
View
DGCI
2000
Springer
15 years 8 months ago
An Efficient Shape-Based Approach to Image Retrieval
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...
Ioannis Fudos, Leonidas Palios
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 11 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
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...
Jérémy Barbay, Johannes Fischer
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 5 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
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...
Rasmus Pagh, Srinivasa Rao Satti
GIS
2009
ACM
15 years 11 months ago
Constrained reverse nearest neighbor search on mobile objects
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...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
16 years 5 months ago
Spatial Outsourcing for Location-based Services
- 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...
Yin Yang, Stavros Papadopoulos, Dimitris Papadias,...