Sciweavers

1272 search results - page 152 / 255
» The Set Cover with Pairs Problem
Sort
View
101
Voted
ICC
2007
IEEE
203views Communications» more  ICC 2007»
15 years 7 months ago
Distributed Data Aggregation Using Clustered Slepian-Wolf Coding in Wireless Sensor Networks
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
Pu Wang, Cheng Li, Jun Zheng
PODC
2005
ACM
15 years 6 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
94
Voted
COCOA
2008
Springer
15 years 2 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
116
Voted
JMLR
2010
144views more  JMLR 2010»
14 years 7 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
110
Voted
ICCAD
2006
IEEE
139views Hardware» more  ICCAD 2006»
15 years 9 months ago
Analog placement with symmetry and other placement constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
Yiu-Cheong Tam, Evangeline F. Y. Young, Chris C. N...