1591 search results - page 22 / 319 » Random lifts of graphs |
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
109
click to vote
WAW
2007
Springer
15 years 6 months ago
2007
Springer
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
109
click to vote
CORR
2008
Springer
15 years 25 days ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
106
click to vote
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
128
Voted
SDM
2012
SIAM
13 years 3 months ago
2012
SIAM
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...