Sciweavers

598 search results - page 42 / 120
» A random graph model for massive graphs
Sort
View
CVPR
2005
IEEE
15 years 1 months ago
Multilabel Random Walker Image Segmentation Using Prior Models
The recently introduced random walker segmentation algorithm of [14] has been shown to have desirable theoretical properties and to perform well on a wide variety of images in pra...
Leo Grady
FCS
2009
13 years 8 months ago
Spectral Analysis of Attractors in Random Boolean Network Models
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
Kenneth A. Hawick
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 11 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
WSC
2000
14 years 9 days ago
Mathematical programming models of discrete event system dynamics
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...
Lee Schruben
FGR
2008
IEEE
346views Biometrics» more  FGR 2008»
14 years 5 months ago
Markov random field models for hair and face segmentation
This paper presents an algorithm for measuring hair and face appearance in 2D images. Our approach starts by using learned mixture models of color and location information to sugg...
Kuang-chih Lee, Dragomir Anguelov, Baris Sumengen,...