895 search results - page 29 / 179 » Approximate convex decomposition |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
COLT
2010
Springer
14 years 7 months ago
2010
Springer
Let S be an arbitrary measurable space, T R and (X, Y ) be a random couple in S
99
Voted
ECCV
2010
Springer
15 years 2 days ago
2010
Springer
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...
IVC
2002
14 years 9 months ago
2002
Object decomposition into simpler parts greatly diminishes the complexity of a recognition task. In this paper, we present a method to decompose a 3D discrete object into nearly c...
CMA
2010
14 years 7 months ago
2010
: The Adomian Decomposition Method (ADM) shows a very good ability in dealing with nonlinear differential equations but it is still have some drawbacks. In this paper, it is shown ...