613 search results - page 79 / 123 » Query Evaluation on a Database Given by a Random Graph |
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Many feature detection algorithms rely on the choice of scale. In this paper, we complement standard scaleselection algorithms with spatial regularization. To this end, we formula...
189
click to vote
SIGMOD
2006
ACM
16 years 12 hour ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
WSNA
2003
ACM
15 years 5 months ago
2003
ACM
Sensor networks have become an important source of data with numerous applications in monitoring various real-life phenomena as well as industrial applications and traffic contro...
136
click to vote
DASFAA
2010
IEEE
15 years 3 months ago
2010
IEEE
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
145
click to vote
STOC
1998
ACM
15 years 4 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...