2841 search results - page 162 / 569 » A Call to Order |
192
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
149
Voted
ICSE
2003
IEEE-ACM
16 years 7 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
201
Voted
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we propose a new model of resilient data aggregation in sensor networks, where the aggregator analyzes the received sensor readings and tries to detect unexpected d...
183
Voted
PPOPP
2010
ACM
16 years 4 months ago
2010
ACM
Transactional memory promises to make parallel programming easier than with fine-grained locking, while performing just as well. This performance claim is not always borne out bec...
174
Voted
ECIR
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Collecting relevance judgments (qrels) is an especially challenging part of building an information retrieval test collection. This paper presents a novel method for crea...