Sciweavers

1414 search results - page 247 / 283
» Randomness and Universal Machines
Sort
View
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 10 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 10 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
MSWIM
2009
ACM
14 years 4 months ago
Designing an asynchronous group communication middleware for wireless users
We evaluate an asynchronous gossiping middleware for wireless users that propagates messages from any group member to all the other group members. This propagation can either be i...
Xuwen Yu, Surendar Chandra
FOCS
2007
IEEE
14 years 4 months ago
Cryptography from Sunspots: How to Use an Imperfect Reference String
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
Ran Canetti, Rafael Pass, Abhi Shelat
SRDS
2006
IEEE
14 years 3 months ago
Call Availability Prediction in a Telecommunication System: A Data Driven Empirical Approach
Availability prediction in a telecommunication system plays a crucial role in its management, either by alerting the operator to potential failures or by proactively initiating pr...
Günther A. Hoffmann, Miroslaw Malek