2270 search results - page 266 / 454 » On the distribution of eigenvalues of graphs |
194
click to vote
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
The need for sharing is well known in a large number of distributed collaborative applications. These applications are difficult to develop for wide area (possibly mobile) networ...
172
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
180
click to vote
ICPP
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...
181
click to vote
PPOPP
1997
ACM
15 years 10 months ago
1997
ACM
Array remappings are useful to many applications on distributed memory parallel machines. They are available in High Performance Fortran, a Fortran-based data-parallel language. T...
175
click to vote
ESCIENCE
2007
IEEE
15 years 10 months ago
2007
IEEE
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...