Sciweavers

712 search results - page 32 / 143
» A mixture model for random graphs
Sort
View
ICPR
2002
IEEE
14 years 11 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...
VTC
2006
IEEE
121views Communications» more  VTC 2006»
14 years 4 months ago
Location-Dependent Parameterization of a Random Direction Mobility Model
— Mobility models are widely used in simulation-based performance analyses of mobile networks. However, there is a trade-off between simplicity and realistic movement patterns. S...
Bernd Gloss, Michael Scharf, Daniel Neubauer
ICPR
2002
IEEE
14 years 11 months ago
Fractional Component Analysis (FCA) for Mixed Signals
This paper proposes the fractional component analysis (FCA), whose goal is to decompose the observed signal into component signals and recover their fractions. The uniqueness of o...
Asanobu Kitamoto
ECCV
2006
Springer
15 years 5 days ago
Smooth Image Segmentation by Nonparametric Bayesian Inference
A nonparametric Bayesian model for histogram clustering is proposed to automatically determine the number of segments when Markov Random Field constraints enforce smooth class assi...
Peter Orbanz, Joachim M. Buhmann
CORR
2011
Springer
152views Education» more  CORR 2011»
13 years 5 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...