2084 search results - page 82 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—The delivery of latency sensitive packets is a crucial issue in real time applications of communication networks. Such packets often have a firm deadline and a packet becomes u...
COCO
2006
Springer
15 years 1 months ago
2006
Springer
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
121
click to vote
COMPGEOM
1992
ACM
15 years 1 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
110
click to vote
COCO
2009
Springer
15 years 4 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...