Sciweavers

2326 search results - page 165 / 466
» Optimization on Support Vector Machines
Sort
View
SEAL
1998
Springer
15 years 2 months ago
Evolutionary Programming-Based Uni-vector Field Method for Fast Mobile Robot Navigation
Most of the obstacle avoidance techniques do not consider the robot orientation or its nal angle at the target position. These techniques deal with the robot position only and are ...
Yong-Jae Kim, Dong-Han Kim, Jong-Hwan Kim
ICCS
2001
Springer
15 years 2 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 9 days ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
JMLR
2008
133views more  JMLR 2008»
14 years 10 months ago
Algorithms for Sparse Linear Classifiers in the Massive Data Setting
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
Suhrid Balakrishnan, David Madigan
TIT
2002
86views more  TIT 2002»
14 years 10 months ago
Lagrangian empirical design of variable-rate vector quantizers: consistency and convergence rates
Abstract--The Lagrangian formulation of variable-rate vector quantization is known to yield useful necessary conditions for quantizer optimality and generalized Lloyd algorithms fo...
Tamás Linder