Sciweavers

370 search results - page 51 / 74
» Improved Approximation Algorithms for Connected Sensor Cover
Sort
View
POPL
2007
ACM
15 years 10 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
CGF
2002
187views more  CGF 2002»
14 years 9 months ago
Stylizing Silhouettes at Interactive Rates: From Silhouette Edges to Silhouette Strokes
A way to create effective stylized line drawings is to draw strokes that start and stop at visible portions along the silhouette of an object to be portrayed. In computer graphics...
Tobias Isenberg, Nick Halper, Thomas Strothotte
INFOCOM
2012
IEEE
13 years 7 days ago
DEAR: Delay-bounded Energy-constrained Adaptive Routing in wireless sensor networks
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, Cho...
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
15 years 10 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
DCOSS
2011
Springer
13 years 9 months ago
Distributed local broadcasting algorithms in the physical interference model
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Franci...