2168 search results - page 216 / 434 » Randomized Algorithms and Complexity Theory |
148
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...
226
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
131
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
148
Voted
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
108
Voted
COCO
2008
Springer
15 years 5 months ago
2008
Springer
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...