2393 search results - page 236 / 479 » Bounds-Consistent Local Search |
154
click to vote
SIGMOD
2012
ACM
13 years 6 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
191
Voted
SIGIR
2012
ACM
13 years 6 months ago
2012
ACM
We introduce the problem of domain adaptation for content-based retrieval and propose a domain adaptation method based on relative aggregation points (RAPs). Content-based retriev...
156
click to vote
JSAT
2008
15 years 3 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
115
click to vote
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we present a method to retrieve natural images by sketch query. To measure the similarity between the sketch and an image, relevant regions are first located in th...
131
click to vote
ESANN
2006
15 years 5 months ago
2006
The Blind Source Separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical dependency between outputs. Since global maximization may be ...