308 search results - page 39 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
101
Voted
SODA
2003
ACM
14 years 11 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
89
Voted
WINE
2007
Springer
15 years 3 months ago
2007
Springer
We study the problem of hiring a team of selfish agents to perform a task. Each agent is assumed to own one or more elements of a set system, and the auctioneer is trying to purch...
TIT
2010
14 years 4 months ago
2010
We consider the capacity of a wideband fading channel with partial feedback, subject to an average power constraint. A doubly block Rayleigh fading model is assumed with finite co...
71
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
71
Voted
ROBOCOMM
2007
IEEE
15 years 4 months ago
2007
IEEE
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...