Sciweavers

2519 search results - page 153 / 504
» Martingales and Locality in Distributed Computing
Sort
View
IWOCA
2010
Springer
232views Algorithms» more  IWOCA 2010»
13 years 4 months ago
Computing Role Assignments of Proper Interval Graphs in Polynomial Time
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
Pinar Heggernes, Pim van 't Hof, Daniël Paulu...
FOSSACS
2005
Springer
14 years 3 months ago
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
Samy Abbes, Albert Benveniste
PASTE
2010
ACM
14 years 3 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
FGR
2004
IEEE
170views Biometrics» more  FGR 2004»
14 years 1 months ago
3D Shape Constraint for Facial Feature Localization Using Probabilistic-like Output
This paper presents a method to automatically locate facial feature points under large variations in pose, illumination and facial expressions. First we propose a method to calcul...
Longbin Chen, Lei Zhang, HongJiang Zhang, Mohamed ...
ECCV
2010
Springer
14 years 1 months ago
Recursive Coarse-to-Fine Localization for fast Object Detection
Cascading techniques are commonly used to speed-up the scan of an image for object detection. However, cascades of detectors are slow to train due to the high number of detectors a...
Marco Pedersoli, Jordi Gonzàlez, Andrew D. Bagdan...