Sciweavers

106 search results - page 21 / 22
» On the Approximability of the Steiner Tree Problem in Phylog...
Sort
View
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 5 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
INFOCOM
2008
IEEE
14 years 1 months ago
Minimum Cost Data Aggregation with Localized Processing for Statistical Inference
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...
Animashree Anandkumar, Lang Tong, Ananthram Swami,...
INFOCOM
2010
IEEE
13 years 6 months ago
Information Quality Aware Routing in Event-Driven Sensor Networks
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...
Hwee-Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng ...
CIC
2004
118views Communications» more  CIC 2004»
13 years 8 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
EWSN
2004
Springer
14 years 25 days ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...