Sciweavers

712 search results - page 80 / 143
» A mixture model for random graphs
Sort
View
HICSS
2006
IEEE
152views Biometrics» more  HICSS 2006»
14 years 1 months ago
Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan...
BMVC
2001
13 years 10 months ago
Graph Matching using Adjacency Matrix Markov Chains
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
Antonio Robles-Kelly, Edwin R. Hancock
HLK
2003
IEEE
14 years 1 months ago
Bayesian Reconstruction of 3D Shapes and Scenes From A Single Image
It’s common experience for human vision to perceive full 3D shape and scene from a single 2D image with the occluded parts “filled-in” by prior visual knowledge. In this pa...
Feng Han, Song Chun Zhu
MSWIM
2004
ACM
14 years 1 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
WWW
2009
ACM
14 years 8 months ago
Graffiti: node labeling in heterogeneous networks
We introduce a multi-label classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of...
Ralitsa Angelova, Gjergji Kasneci, Fabian M. Sucha...