Sciweavers

387 search results - page 44 / 78
» Reasoning About Approximate Match Query Results
Sort
View
ICMCS
2007
IEEE
255views Multimedia» more  ICMCS 2007»
14 years 3 months ago
Distributed Architecture for Large Scale Image-Based Search
In recent years, some computer vision algorithms such as SIFT (Scale Invariant Feature Transform) have been employed in image similarity match to perform image-based search applic...
Yu Zheng, Xing Xie, Wei-Ying Ma
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 9 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
SIGMOD
2008
ACM
210views Database» more  SIGMOD 2008»
14 years 8 months ago
Private queries in location based services: anonymizers are not necessary
Mobile devices equipped with positioning capabilities (e.g., GPS) can ask location-dependent queries to Location Based Services (LBS). To protect privacy, the user location must n...
Gabriel Ghinita, Panos Kalnis, Ali Khoshgozaran, C...
GIS
2009
ACM
14 years 3 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...
XSYM
2004
Springer
115views Database» more  XSYM 2004»
14 years 2 months ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras