Sciweavers

34 search results - page 5 / 7
» Privacy preserving group nearest neighbor queries
Sort
View
CVPR
2004
IEEE
15 years 11 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
67
Voted
CIKM
2005
Springer
15 years 3 months ago
Privacy leakage in multi-relational databases via pattern based semi-supervised learning
In multi-relational databases, a view, which is a context- and content-dependent subset of one or more tables (or other views), is often used to preserve privacy by hiding sensiti...
Hui Xiong, Michael Steinbach, Vipin Kumar
SIGMOD
2005
ACM
109views Database» more  SIGMOD 2005»
15 years 9 months ago
Query-Sensitive Embeddings
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
Vassilis Athitsos, Marios Hadjieleftheriou, George...
PVLDB
2010
121views more  PVLDB 2010»
14 years 4 months ago
Efficient RkNN Retrieval with Arbitrary Non-Metric Similarity Measures
A RkNN query returns all objects whose nearest k neighbors contain the query object. In this paper, we consider RkNN query processing in the case where the distances between attri...
Deepak P, Prasad Deshpande
ECCV
2010
Springer
15 years 1 months ago
Accurate Image Localization Based on Google Maps Street View
Abstract. Finding an image’s exact GPS location is a challenging computer vision problem that has many real-world applications. In this paper, we address the problem of finding ...