Sciweavers

598 search results - page 69 / 120
» A random graph model for massive graphs
Sort
View
ECCV
2002
Springer
16 years 1 months ago
Factorial Markov Random Fields
In this paper we propose an extension to the standard Markov Random Field (MRF) model in order to handle layers. Our extension, which we call a Factorial MRF (FMRF), is analogous t...
Junhwan Kim, Ramin Zabih
WWW
2004
ACM
16 years 16 days ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit
ICPR
2010
IEEE
14 years 11 months ago
3D Vertebrae Segmentation in CT Images with Random Noises
Exposure levels (X-ray tube amperage and peak kilovoltage) are associated with various noise levels and radiation dose. When higher exposure levels are applied, the images have hi...
Melih Seref Aslan
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
JAL
2000
119views more  JAL 2000»
14 years 11 months ago
On Markov Chains for Independent Sets
Random independent sets in graphs arise, for example, in statistical physics, in the hard-core model of a gas. In 1997, Luby and Vigoda described a rapidly mixing Markov chain for...
Martin E. Dyer, Catherine S. Greenhill