Sciweavers

654 search results - page 117 / 131
» An efficient approximation algorithm for the survivable netw...
Sort
View
FOCS
2004
IEEE
13 years 11 months ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler
TASE
2011
IEEE
12 years 11 months ago
Fast Intersection-Free Offset Surface Generation From Freeform Models With Triangular Meshes
Abstract—A fast offset surface generation approach is presented in this paper to construct intersection-free offset surfaces, which preserve sharp features, from freeform triangu...
Shengjun Liu, Charlie C. L. Wang
INFOCOM
2010
IEEE
13 years 6 months ago
Reliable Adaptive Multipath Provisioning with Bandwidth and Differential Delay Constraints
Abstract— Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous ro...
Weiyi Zhang, Jian Tang, Chonggang Wang, Shanaka de...
IPPS
2008
IEEE
14 years 2 months ago
Sweep coverage with mobile sensors
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
Wei-Fang Cheng, Mo Li, Kebin Liu, Yunhao Liu, Xian...
SODA
2007
ACM
106views Algorithms» more  SODA 2007»
13 years 9 months ago
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
Ittai Abraham, Yair Bartal, Ofer Neiman