Sciweavers

2723 search results - page 282 / 545
» Learning lexicographic orders
Sort
View
ICML
2010
IEEE
15 years 7 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
JSAT
2006
134views more  JSAT 2006»
15 years 6 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
Hossein M. Sheini, Karem A. Sakallah
ICPR
2008
IEEE
16 years 7 months ago
Graph-based classification for multiple observations of transformed patterns
We consider the problem of classification when multiple observations of a pattern are available, possibly under different transformations. We view this problem as a special case o...
Effrosini Kokiopoulou, Pascal Frossard, Stefanos P...
ICML
2008
IEEE
16 years 7 months ago
Fast Gaussian process methods for point process intensity estimation
Point processes are difficult to analyze because they provide only a sparse and noisy observation of the intensity function driving the process. Gaussian Processes offer an attrac...
John P. Cunningham, Krishna V. Shenoy, Maneesh Sah...
ICML
2008
IEEE
16 years 7 months ago
Fast nearest neighbor retrieval for bregman divergences
We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measu...
Lawrence Cayton