50 search results - page 6 / 10 » post 2012 |
106
Voted
PLDI
2012
ACM
13 years 19 days ago
2012
ACM
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
117
Voted
PODC
2012
ACM
13 years 18 days ago
2012
ACM
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...
95
Voted
PODC
2012
ACM
13 years 18 days ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
106
Voted
STOC
2012
ACM
13 years 18 days ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
106
click to vote
KDD
2012
ACM
13 years 18 days ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...