Sciweavers

1092 search results - page 34 / 219
» Convex Methods for Transduction
Sort
View
ICPR
2006
IEEE
14 years 8 months ago
Convex Quadratic Programming for Object Localization
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very li...
Hao Jiang, Mark S. Drew, Ze-Nian Li
HIS
2008
13 years 9 months ago
Improving the Performance of Partitioning Methods for Crowd Simulations
Simulating the realistic behavior of large crowds of autonomous agents is still a challenge for the computer graphics community. In order to handle large crowds, some scalable arc...
Guillermo Vigueras, Miguel Lozano, Juan Manuel Ord...
SIAMJO
2010
84views more  SIAMJO 2010»
13 years 6 months ago
A Redistributed Proximal Bundle Method for Nonconvex Optimization
Proximal bundle methods have been shown to be highly successful optimization methods for unconstrained convex problems with discontinuous first derivatives. This naturally leads ...
Warren Hare, Claudia A. Sagastizábal
SIAMJO
2000
113views more  SIAMJO 2000»
13 years 7 months ago
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
Masakazu Kojima, Levent Tunçel
ICML
2007
IEEE
14 years 8 months ago
Sparse eigen methods by D.C. programming
Eigenvalue problems are rampant in machine learning and statistics and appear in the context of classification, dimensionality reduction, etc. In this paper, we consider a cardina...
Bharath K. Sriperumbudur, David A. Torres, Gert R....