Sciweavers

870 search results - page 54 / 174
» The failure detector abstraction
Sort
View
ISBI
2004
IEEE
14 years 10 months ago
Reconstruction of 2D Pet Data with Monte Carlo Generated Natural Pixels
Abstract-In discrete detector PET, natural pixels are image basis functions calculated from responses of detector pairs. By using reconstruction with natural pixels the discretizat...
Charles L. Byrne, Stefaan Vandenberghe, Edward J. ...
ICIAR
2010
Springer
14 years 2 months ago
Adaptation of SIFT Features for Robust Face Recognition
Abstract. The Scale Invariant Feature Transform (SIFT) is an algorithm used to detect and describe scale-, translation- and rotation-invariant local features in images. The origina...
Janez Krizaj, Vitomir Struc, Nikola Pavesic
FLAIRS
2006
13 years 10 months ago
On Repairing Reasoning Reversals via Representational Refinements
Representation is a fluent. A mismatch between the real world and an agent's representation of it can be signalled by unexpected failures (or successes) of the agent's r...
Alan Bundy, Fiona McNeill, Christopher Walton
CVPR
2004
IEEE
14 years 11 months ago
Tracking Loose-Limbed People
We pose the problem of 3D human tracking as one of inference in a graphical model. Unlike traditional kinematic tree representations, our model of the body is a collection of loos...
Leonid Sigal, Sidharth Bhatia, Stefan Roth, Michae...
SAC
2010
ACM
14 years 4 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...