1776 search results - page 180 / 356 » Uncertain Linear Constraints |
158
click to vote
IMA
2001
Springer
15 years 10 months ago
2001
Springer
Standard runlength-limiting codes – nonlinear codes defined by trellises – have the disadvantage that they disconnect the outer errorcorrecting code from the bit-by-bit likeli...
153
click to vote
WADS
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
195
click to vote
SIAMCOMP
1998
15 years 5 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...
186
click to vote
ICCV
2011
IEEE
14 years 6 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...
185
click to vote
ESA
2005
Springer
15 years 11 months 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...