895 search results - page 3 / 179 » Approximate convex decomposition |
CCE
2004
14 years 9 months ago
2004
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
113
click to vote
COCOS
2003
Springer
15 years 2 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
118
click to vote
INFOCOM
2012
IEEE
13 years 17 hour ago
2012
IEEE
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...