Sciweavers

320 search results - page 26 / 64
» Rigorous Result for the CHKNS Random Graph Model
Sort
View
MSWIM
2004
ACM
15 years 5 months ago
Quantile models for the threshold range for k-connectivity
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
Henri Koskinen
SIGMETRICS
2005
ACM
15 years 5 months ago
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
Derek Leonard, Vivek Rai, Dmitri Loguinov
JMLR
2010
158views more  JMLR 2010»
14 years 6 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe
ICPR
2008
IEEE
15 years 6 months ago
Video object segmentation based on graph cut with dynamic shape prior constraint
In this work, we present a novel segmentation method for deformable objects in monocular videos. Firstly we introduce the dynamic shape to represent the prior knowledge about obje...
Peng Tang, Lin Gao
ICCV
2003
IEEE
16 years 1 months ago
Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters
Recent stereo algorithms have achieved impressive results by modelling the disparity image as a Markov Random Field (MRF). An important component of an MRF-based approach is the i...
Marshall F. Tappen, William T. Freeman