948 search results - page 74 / 190 » What can we achieve by arbitrary announcements |
ICDCS
2012
IEEE
11 years 10 months ago
2012
IEEE
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
ECCC
2006
13 years 7 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
ISSTA
2009
ACM
14 years 2 months ago
2009
ACM
Metamorphic testing has been shown to be a simple yet effective technique in addressing the quality assurance of applications that do not have test oracles, i.e., for which it is ...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is co...