1403 search results - page 168 / 281 » Set cover algorithms for very large datasets |
168
Voted
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
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...
184
click to vote
WSDM
2010
ACM
15 years 11 months ago
2010
ACM
Ranking a set of retrieved documents according to their relevance to a given query has become a popular problem at the intersection of web search, machine learning, and informatio...
156
click to vote
SIGMOD
1997
ACM
15 years 9 months ago
1997
ACM
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
255
Voted
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper deals with generalized procrustes analysis. This is the problem of registering a set of shape data by estimating a reference shape and a set of rigid transformations gi...
178
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Classifying high-dimensional numerical data is a very challenging problem. In high dimensional feature spaces, the performance of supervised learning methods suffer from the curse...