1469 search results - page 188 / 294 » Approximate polynomial decomposition |
172
click to vote
CG
2002
Springer
15 years 6 months ago
2002
Springer
: In raster graphics, a line is displayed as a sequence of connected pixels that best approximate the line with minimum deviation. The displacement code of a line is a sequence of ...
166
click to vote
SCHOLARPEDIA
2008
15 years 5 months ago
2008
A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higher-order structure in the association of terms with documents (&q...
124
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— We present a new retraction algorithm for high DOF articulated models and use our algorithm to improve the performance of RRT planners in narrow passages. The retraction step i...
168
click to vote
FOCS
2007
IEEE
16 years 22 days ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
167
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...