4894 search results - page 543 / 979 » The Guarding Problem - Complexity and Approximation |
132
click to vote
CG
2002
Springer
15 years 4 months ago
2002
Springer
We present new algorithms for the robust transmission of geometric data sets, i.e. transmission which allows the receiver to recover (an approximation of) the original geometric o...
129
click to vote
CVGIP
2002
15 years 4 months ago
2002
This paper proposes a simple approach to the affine motion interpolation problem, where an affine spline motion is generated that interpolates a given sequence of affine keyframes...
147
click to vote
IJAR
2002
15 years 4 months ago
2002
We develop a decision-theoretic method that yields approximate, low cost troubleshooting plans by making more relevant observations and devoting more time to generate a plan. The ...
135
Voted
TNN
1998
15 years 4 months ago
1998
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
127
click to vote
TIT
2002
15 years 4 months ago
2002
We consider the problem of estimating the feedback coefficients of a linear feedback shift register (LFSR) based on noisy observations. In the current approach, the coefficients a...