Sciweavers

301 search results - page 51 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
106
Voted
PODS
2008
ACM
174views Database» more  PODS 2008»
15 years 11 months ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...
79
Voted
PODS
2008
ACM
123views Database» more  PODS 2008»
15 years 11 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
CVPR
2005
IEEE
16 years 28 days ago
Computer Vision for Music Identification
We describe how certain tasks in the audio domain can be effectively addressed using computer vision approaches. This paper focuses on the problem of music identification, where t...
Yan Ke, Derek Hoiem, Rahul Sukthankar
VLDB
2007
ACM
181views Database» more  VLDB 2007»
15 years 11 months ago
STAR: Self-Tuning Aggregation for Scalable Monitoring
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
Navendu Jain, Michael Dahlin, Yin Zhang, Dmitry Ki...
CVPR
2003
IEEE
16 years 28 days ago
Nearest Neighbor Search for Relevance Feedback
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
Jelena Tesic, B. S. Manjunath