Sciweavers

316 search results - page 31 / 64
» Approximation algorithms for hierarchical location problems
Sort
View
CVPR
2010
IEEE
14 years 3 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
TON
2010
197views more  TON 2010»
13 years 5 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
CRV
2007
IEEE
101views Robotics» more  CRV 2007»
13 years 11 months ago
Energy Efficient Robot Rendezvous
We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous i...
Pawel Zebrowski, Yaroslav Litus, Richard T. Vaugha...
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 9 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
ICDE
2006
IEEE
208views Database» more  ICDE 2006»
14 years 1 months ago
Approximate Video Search Based on Spatio-Temporal Information of Video Objects
The spatio-temporal information of a video object is important for content-based video retrieval. In this paper the spatio-temporal information of a video object, such as the velo...
Chia-Han Lin, Arbee L. P. Chen