Sciweavers

712 search results - page 84 / 143
» A mixture model for random graphs
Sort
View
LICS
2002
IEEE
14 years 22 days ago
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
Sophie Laplante, Richard Lassaigne, Fréd&ea...
COLT
2004
Springer
14 years 1 months ago
Learning a Hidden Graph Using O(log n) Queries Per Edge
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
Dana Angluin, Jiang Chen

Publication
1851views
15 years 9 months ago
Cerebrovascular Segmentation from TOF Using Stochastic Models
In this paper, we present an automatic statistical approach for extracting 3D blood vessels from time-of-flight (TOF) magnetic resonance angiography (MRA) data. The voxels of the d...
M. Sabry Hassouna, Aly A. Farag, Stephen Hushek, T...
NIPS
2003
13 years 9 months ago
Attractive People: Assembling Loose-Limbed Models using Non-parametric Belief Propagation
The detection and pose estimation of people in images and video is made challenging by the variability of human appearance, the complexity of natural scenes, and the high dimensio...
Leonid Sigal, Michael Isard, Benjamin H. Sigelman,...
ICASSP
2011
IEEE
12 years 11 months ago
Scalable robust hypothesis tests using graphical models
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
Divyanshu Vats, Vishal Monga, Umamahesh Srinivas, ...