Sciweavers

712 search results - page 66 / 143
» A mixture model for random graphs
Sort
View
WCNC
2010
IEEE
15 years 5 months ago
Node Connectivity Analysis in Multi-Hop Wireless Networks
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
Bahador Bakhshi, Siavash Khorsandi
ECCV
2002
Springer
16 years 3 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 2 months 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
114
Voted
ICPR
2010
IEEE
15 years 14 days 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
RSA
2010
107views more  RSA 2010»
14 years 12 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou