Sciweavers

67 search results - page 9 / 14
» On a global optimization technique for solving a nonlinear h...
Sort
View
CIAC
2000
Springer
105views Algorithms» more  CIAC 2000»
13 years 12 months ago
Algorithms for a Simple Point Placement Problem
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
Joshua Redstone, Walter L. Ruzzo
ESANN
2004
13 years 9 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
WEA
2010
Springer
243views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments with a Feasibility Pump Approach for Nonconvex MINLPs
We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorith...
Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti...
CGF
2008
127views more  CGF 2008»
13 years 7 months ago
Fitting Sharp Features with Loop Subdivision Surfaces
Various methods have been proposed for fitting subdivision surfaces to different forms of shape data (e.g., dense meshes or point clouds), but none of these methods effectively de...
Ruotian Ling, Wenping Wang, Dong-Ming Yan
ICCV
2005
IEEE
14 years 1 months ago
Space-Time Scene Manifolds
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
Yonatan Wexler, Denis Simakov