2084 search results - page 408 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
WSDM
2012
ACM
13 years 5 months ago
2012
ACM
As massive repositories of real-time human commentary, social media platforms have arguably evolved far beyond passive facilitation of online social interactions. Rapid analysis o...
72
Voted
JMLR
2010
14 years 8 months ago
2010
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...
IMC
2007
ACM
14 years 11 months ago
2007
ACM
A wide range of transmit power control (TPC) algorithms have been proposed in recent literature to reduce interference and increase capacity in 802.11 wireless networks. However, ...
ML
2008
ACM
14 years 9 months ago
2008
ACM
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...