Sciweavers

459 search results - page 62 / 92
» Average Case Analysis of Conjunctive Learning Algorithms
Sort
View
COLT
2005
Springer
14 years 2 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
CORR
2011
Springer
177views Education» more  CORR 2011»
13 years 21 days ago
Gossip PCA
Eigenvectors of data matrices play an important role in many computational problems, ranging from signal processing to machine learning and control. For instance, algorithms that ...
Satish Babu Korada, Andrea Montanari, Sewoong Oh
ICML
2003
IEEE
14 years 9 months ago
Adaptive Overrelaxed Bound Optimization Methods
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...
Ruslan Salakhutdinov, Sam T. Roweis
BMCBI
2010
182views more  BMCBI 2010»
13 years 9 months ago
L2-norm multiple kernel learning and its application to biomedical data fusion
Background: This paper introduces the notion of optimizing different norms in the dual problem of support vector machines with multiple kernels. The selection of norms yields diff...
Shi Yu, Tillmann Falck, Anneleen Daemen, Lé...
ICCV
1998
IEEE
14 years 1 months ago
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
Sébastien Roy, Ingemar J. Cox