Sciweavers

1082 search results - page 63 / 217
» Approximation Algorithms for Spreading Points
Sort
View
JCO
2010
182views more  JCO 2010»
13 years 6 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
NIPS
2007
13 years 9 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
MP
2010
154views more  MP 2010»
13 years 6 months ago
A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
Abstract. We present a null-space primal-dual interior-point algorithm for solving nonlinear optimization problems with general inequality and equality constraints. The algorithm a...
Xinwei Liu, Yaxiang Yuan
CVPR
2006
IEEE
14 years 9 months ago
The Panum Proxy Algorithm for Dense Stereo Matching over a Volume of Interest
Stereo matching algorithms conventionally match over a range of disparities sufficient to encompass all visible 3D scene points. Human vision however does not do this. It works ov...
Ankur Agarwal, Andrew Blake
GIS
2007
ACM
14 years 8 months ago
Approximate order-k Voronoi cells over positional streams
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
Kostas Patroumpas, Theofanis Minogiannis, Timos K....