1039 search results - page 119 / 208 » Kernels and Regularization on Graphs |
114
click to vote
ACSC
2005
IEEE
15 years 6 months ago
2005
IEEE
The global dynamics of automata networks (such as neural networks) are a function of their topology and the choice of automata used. Evolutionary methods can be applied to the opt...
JPDC
2006
15 years 23 days ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
CPC
1998
15 years 14 days ago
1998
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
JMLR
2010
14 years 7 months ago
2010
This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic fun...
122
Voted
PPOPP
2010
ACM
15 years 7 months ago
2010
ACM
This paper presents an analytical model to predict the performance of general-purpose applications on a GPU architecture. The model is designed to provide performance information ...