323 search results - page 44 / 65 » Distributed Verification and Hardness of Distributed Approxi... |
155
Voted
SIGECOM
2011
ACM
14 years 5 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
161
Voted
KDD
2003
ACM
16 years 3 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
146
click to vote
PODS
2005
ACM
16 years 2 months ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
138
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
158
Voted
IPSN
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...