2079 search results - page 139 / 416 » Universality of random graphs |
156
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Interactive image segmentation traditionally involves the
use of algorithms such as Graph Cuts or Random Walker.
Common concerns with using Graph Cuts are metrication
artifacts ...
220
click to vote
ICML
2003
IEEE
16 years 5 months ago
2003
IEEE
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
138
click to vote
RSA
2010
15 years 3 months ago
2010
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...
139
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
170
click to vote
SASN
2004
ACM
15 years 10 months ago
2004
ACM
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...