3874 search results - page 185 / 775 » Approximation Algorithms for k-hurdle Problems |
SDM
2007
SIAM
15 years 3 months ago
2007
SIAM
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
104
click to vote
SDM
2010
SIAM
15 years 3 months ago
2010
SIAM
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
118
Voted
SODA
2008
ACM
15 years 3 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
142
click to vote
COCOON
2004
Springer
15 years 5 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
113
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...