1591 search results - page 105 / 319 » Random lifts of graphs |
153
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
183
click to vote
AOSD
2007
ACM
15 years 10 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
189
click to vote
JSAC
2008
15 years 6 months ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
215
click to vote
PAMI
2010
15 years 1 months ago
2010
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
138
click to vote
COCOON
2009
Springer
16 years 28 days ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...