Sciweavers

402 search results - page 71 / 81
» Constant-Time Approximation Algorithms via Local Improvement...
Sort
View

Publication
353views
14 years 5 months ago
Shape from Shading with Perspective Projection
Most conventional SFS (shape from shading) algorithms have been developed under the assumption of orthographic projection. However, the assumption is not valid when an object is no...
Kyoung Mu Lee (Seoul National University), C.-C. J...
MOBIHOC
2010
ACM
13 years 5 months ago
Barrier coverage with sensors of limited mobility
Barrier coverage is a critical issue in wireless sensor networks for various battlefield and homeland security applications. The goal is to effectively detect intruders that attem...
Anwar Saipulla, Benyuan Liu, Guoliang Xing, Xinwen...
FOCS
1995
IEEE
13 years 11 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
TCSV
2008
155views more  TCSV 2008»
13 years 7 months ago
Heterogeneous Fusion of Omnidirectional and PTZ Cameras for Multiple Object Tracking
Dual-camera systems have been widely used in surveillance because of the ability to explore the wide field of view (FOV) of the omnidirectional camera and the wide zoom range of th...
Chung-Hao Chen, Yi Yao, David Page, Besma R. Abidi...
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
14 years 7 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter