2079 search results - page 91 / 416 » Universality of random graphs |
139
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
133
Voted
CPC
2006
15 years 4 months ago
2006
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
120
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
163
click to vote
NIPS
2004
15 years 5 months ago
2004
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...
123
click to vote
HAIS
2009
Springer
15 years 9 months ago
2009
Springer
This paper presents a hybrid evolutionary algorithm to tackle university course timetabling problems. The proposed approach is an extension of a non-linear great deluge algorithm i...