2270 search results - page 239 / 454 » On the distribution of eigenvalues of graphs |
254
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
168
click to vote
GCC
2005
Springer
16 years 2 days ago
2005
Springer
Building a topology-aware peer-to-peer overlay network can bring many advantages, such as providing locality-aware connectivity and reducing routing path length. While its benefit...
263
click to vote
ICPP
2006
IEEE
16 years 18 days ago
2006
IEEE
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
153
click to vote
JCP
2007
15 years 6 months ago
2007
ADE, autonomic distributed environment, is a system which engages autonomic elements to automatically take an existing centralized application and distribute it across available re...
164
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...