4926 search results - page 49 / 986 » Two Graph Algorithms On an Associative Computing Model |
Book
This book covers the following topics: The biological paradigm, Threshold logic, Weighted Networks, The Perceptron, Perceptron learning, Unsupervised learning and clustering algori...
INFOVIS
2002
IEEE
14 years 18 days ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
STOC
2000
ACM
14 years 1 days ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...