4894 search results - page 518 / 979 » The Guarding Problem - Complexity and Approximation |
140
click to vote
3DPVT
2006
IEEE
15 years 11 months ago
2006
IEEE
Shape from silhouette methods are extensively used to model dynamic and non-rigid objects using binary foreground-background images. Since the problem of reconstructing shapes fro...
139
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
146
Voted
PODC
2006
ACM
15 years 10 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
145
click to vote
ENC
2005
IEEE
15 years 10 months ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
150
click to vote
IFIP
2005
Springer
15 years 10 months ago
2005
Springer
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...