3475 search results - page 358 / 695 » Backbones in Optimization and Approximation |
201
click to vote
TIP
2008
15 years 6 months ago
2008
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
190
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract— Robotic routers (mobile robots with wireless communication capabilities) can create an adaptive wireless network and provide communication services for mobile users ond...
189
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
202
Voted
MOC
2011
15 years 1 months ago
2011
Abstract. In this paper, we analyze a hybridizable discontinuous Galerkin method for numerically solving the Stokes equations. The method uses polynomials of degree k for all the c...
286
Voted
SIAMIS
2011
15 years 1 months ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...