337 search results - page 45 / 68 » Efficient algorithms for ranking with SVMs |
168
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
183
click to vote
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
NIPS
2008
15 years 7 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...
160
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Abstract. A new approach, called Collective Shape Difference Classifier (CSDC), is proposed to improve the accuracy and computational efficiency of 3D face recognition. The CSDC le...
156
click to vote
ICPR
2008
IEEE
16 years 18 days ago
2008
IEEE
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...