4843 search results - page 83 / 969 » The Shortcut Problem - Complexity and Approximation |
TPDS
2008
14 years 10 months ago
2008
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with...
SIAMMAX
2011
14 years 24 days ago
2011
This paper studies existence and uniqueness results and interlacing properties of nonlinear modifications of small rank of symmetric eigenvalue problems. Approximation properties ...
203
click to vote
INFOCOM
2012
IEEE
13 years 12 days ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
STOC
1999
ACM
15 years 2 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
ECCV
2008
Springer
15 years 12 months ago
2008
Springer
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...