2168 search results - page 392 / 434 » Randomized Algorithms and Complexity Theory |
126
Voted
SIGECOM
2004
ACM
15 years 8 months ago
2004
ACM
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
148
click to vote
PVG
2003
IEEE
15 years 7 months ago
2003
IEEE
Parallel volume rendering offers a feasible solution to the large data visualization problem by distributing both the data and rendering calculations among multiple computers con...
130
Voted
SIGECOM
2003
ACM
15 years 7 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
109
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
137
Voted
MOBIHOC
2010
ACM
15 years 14 days ago
2010
ACM
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...