Sciweavers

1760 search results - page 77 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
ICDCSW
2008
IEEE
14 years 3 months ago
Mobility Control for Complete Coverage in Wireless Sensor Networks
In this paper, we propose a new control method to cover the “holes” in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are d...
Zhen Jiang, Jie Wu, Robert Kline, Jennifer Krantz
PIMRC
2008
IEEE
14 years 3 months ago
A hierarchical structure based coverage repair in wireless sensor networks
—In this paper, we propose a new control method to cover “holes” in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are dis...
Jie Wu, Zhen Jiang
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 11 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
CVPR
2011
IEEE
13 years 5 months ago
Nonparametric Density Estimation on A Graph: Learning Framework, Fast Approximation and Application in Image Segmentation
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
Zhiding Yu, Oscar Au, Ketan Tang
NCA
2005
IEEE
14 years 2 months ago
Slingshot: Time-Critical Multicast for Clustered Applications
Datacenters are complex environments consisting of thousands of failure-prone commodity components connected by fast, high-capacity interconnects. The software running on such dat...
Mahesh Balakrishnan, Stefan Pleisch, Ken Birman