1416 search results - page 13 / 284 » The Kernel Least-Mean-Square Algorithm |
SODA
2012
ACM
13 years 1 days ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
100
click to vote
NIPS
2004
14 years 11 months ago
2004
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
104
click to vote
CVPR
2012
IEEE
13 years 1 days ago
2012
IEEE
Scene labeling research has mostly focused on outdoor scenes, leaving the harder case of indoor scenes poorly understood. Microsoft Kinect dramatically changed the landscape, show...
93
Voted
SODA
2012
ACM
13 years 1 days ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
NCA
2008
IEEE
14 years 9 months ago
2008
IEEE
Three extensions to the Kernel-AdaTron training algorithm for Support Vector Machine classifier learning are presented. These extensions allow the trained classifier to adhere more...