234 search results - page 5 / 47 » Learning for efficient retrieval of structured data with noi... |
148
click to vote
ICML
2008
IEEE
16 years 6 months ago
2008
IEEE
We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measu...
183
click to vote
CVPR
2009
IEEE
17 years 15 days ago
2009
IEEE
We describe an algorithm for similar-image search which
is designed to be efficient for extremely large collections of
images. For each query, a small response set is selected by...
173
click to vote
CIKM
2011
Springer
14 years 5 months ago
2011
Springer
Community QA portals provide an important resource for non-factoid question-answering. The inherent noisiness of user-generated data makes the identification of high-quality cont...
157
click to vote
ICPR
2000
IEEE
16 years 6 months ago
2000
IEEE
Probabilistic feature relevance learning (PFRL) is an effective technique for adaptively computing local feature relevance for content-based image retrieval. It however becomes le...
200
click to vote
CORR
2010
Springer
15 years 10 days ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...