1192 search results - page 3 / 239 » Computing Weakest Readings |
82
Voted
JACM
2010
14 years 8 months ago
2010
This article determines the weakest failure detectors to implement shared atomic objects in a distributed system with crash-prone processes. We first determine the weakest failure...
125
Voted
PODC
1992
ACM
15 years 1 months ago
1992
ACM
We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In Chandra and Toueg [199...
152
click to vote
CVPR
2011
IEEE
14 years 6 months ago
2011
IEEE
Detecting people remains a popular and challenging problem in computer vision. In this paper, we analyze parts-based models for person detection to determine which components of t...
AINA
2010
IEEE
15 years 2 months ago
2010
IEEE
: This paper is on failure detectors to solve the consensus problem in asynchronous systems made up of anonymous processes prone to crash and connected by asynchronous reliable cha...
TPHOL
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...