Sciweavers

6 search results - page 1 / 2
» Fast Stochastic Frank-Wolfe Algorithms for Nonlinear SVMs
Sort
View
SDM
2010
SIAM
151views Data Mining» more  SDM 2010»
13 years 6 months ago
Fast Stochastic Frank-Wolfe Algorithms for Nonlinear SVMs
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...
Hua Ouyang, Alexander Gray
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
12 years 7 months ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
ICRA
2006
IEEE
102views Robotics» more  ICRA 2006»
13 years 11 months ago
Fast Iterative Alignment of Pose Graphs with Poor Initial Estimates
— A robot exploring an environment can estimate its own motion and the relative positions of features in the environment. Simultaneous Localization and Mapping (SLAM) algorithms ...
Edwin Olson, John J. Leonard, Seth J. Teller
ICPR
2008
IEEE
13 years 11 months ago
Kernel Bisecting k-means clustering for SVM training sample reduction
This paper presents a new algorithm named Kernel Bisecting k-means and Sample Removal (KBK-SR) as a sampling preprocessing for SVM training to improve the scalability. The novel c...
Xiao-Zhang Liu, Guo-Can Feng
AUTOMATICA
2011
12 years 12 months ago
Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms
Previously, idempotent methods have been found to be extremely fast for solution of dynamic programming equations associated with deterministic control problems. The original meth...
William M. McEneaney