2079 search results - page 61 / 416 » Universality of random graphs |
155
click to vote
IJAMCIGI
2010
14 years 11 months ago
2010
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
164
click to vote
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
162
click to vote
CVPR
2009
IEEE
15 years 11 months ago
2009
IEEE
We formulate the problem of salient region detection in images as Markov random walks performed on images represented as graphs. While the global properties of the image are extra...
95
Voted
RECOMB
2006
Springer
16 years 4 months ago
2006
Springer
167
click to vote
MST
2011
14 years 11 months ago
2011
Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erd˝os-R´enyi random graph G(n, p) starting from a set of vertices that are convinced of the message...