2270 search results - page 104 / 454 » On the distribution of eigenvalues of graphs |
148
click to vote
ESANN
2003
15 years 7 months ago
2003
Martinetz and Schulten proposed the use of a Competitive Hebbian Learning (CHL) rule to build Topology Representing Networks. From a set of units and a data distribution, a link i...
140
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k ve...
146
click to vote
HPDC
1998
IEEE
15 years 10 months ago
1998
IEEE
To support a vast set of user requirements, flexibility and extensibility are essential features of a metasystem architecture. We present an execution model, the Reflective Graph ...
152
click to vote
SPAA
1992
ACM
15 years 10 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
163
click to vote
EUROPAR
2004
Springer
15 years 10 months ago
2004
Springer
Abstract This paper proposes an approach to continuously optimizing parallel scientific applications with dynamically changing architectures. We achieve this by combining a dynamic...