1778 search results - page 124 / 356 » On the Power of the Randomized Iterate |
195
click to vote
FOCS
2008
IEEE
16 years 26 days ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
160
click to vote
CORR
2006
Springer
2006
Springer
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
15 years 6 months ago
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
161
click to vote
MONET
2006
15 years 6 months ago
2006
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph. The novel aspect in our study is that for finding t...
176
click to vote
DATE
2007
IEEE
16 years 22 days ago
2007
IEEE
In a parallel system with multiple CPUs, one of the key problems is to assign loop iterations to processors. This problem, known as the loop scheduling problem, has been studied i...
175
click to vote
GLOBECOM
2006
IEEE
16 years 14 days ago
2006
IEEE
— We present the results of simulation experiments that compare end-to-end error management (used in controlled access MAC protocols) against hop-by-hop error management (used in...