2924 search results - page 133 / 585 » Lower Bounds in Distributed Computing |
116
Voted
STOC
2007
ACM
16 years 1 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
102
click to vote
CAV
2007
Springer
15 years 6 months ago
2007
Springer
ng-Lens Abstraction for Markov Decision Processes⋆ In Proc. of CAV 2007: 19th International Conference on Computer-Aided Verification, Lectures Notes in Computer Science. c Spri...
108
Voted
PODC
2010
ACM
15 years 4 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
ICIAP
2007
ACM
16 years 24 days ago
2007
ACM
This paper proposes a novel technique for performing fast block matching for motion estimation which is optimal, meaning it yields the same results as a full-search investigation....
89
Voted
CN
2007
15 years 21 days ago
2007
As next-generation computer worms may spread within minutes to millions of hosts, protection via human intervention is no longer an option. We discuss the implementation of SweetB...