3591 search results - page 278 / 719 » Typing linear constraints |
238
click to vote
SIAMCOMP
1998
15 years 7 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
226
click to vote
ICCV
2011
IEEE
14 years 7 months ago
2011
IEEE
Non-rigid structure from motion (NRSFM) is a difficult, underconstrained problem in computer vision. The standard approach in NRSFM constrains 3D shape deformation using a linear...
212
click to vote
ESA
2005
Springer
16 years 24 days ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
219
click to vote
COLT
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...
204
click to vote
ESEM
2008
ACM
15 years 9 months ago
2008
ACM
Building cost estimation models is often considered a search problem in which the solver should return an optimal solution satisfying an objective function. This solution also nee...