3395 search results - page 298 / 679 » Learning to efficiently rank |
199
click to vote
ICAPR
2001
Springer
15 years 11 months ago
2001
Springer
The goal of this paper is to describe an efficient procedure for color-based image retrieval. The proposed procedure consists of two stages. First, the image data set is hierarchi...
177
click to vote
ICDAR
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper concerns a study of information content in postal address fields for automatic address interpretation. Information provided by a combination of address components and i...
191
Voted
CVPR
2009
IEEE
15 years 10 months ago
2009
IEEE
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...
145
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...
157
click to vote
NIPS
2008
15 years 8 months ago
2008
Large-margin structured estimation methods minimize a convex upper bound of loss functions. While they allow for efficient optimization algorithms, these convex formulations are n...