Sciweavers

2127 search results - page 312 / 426
» Computing large matchings fast
Sort
View
ICPP
1990
IEEE
15 years 8 months ago
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A good solut...
Sunggu Lee, Kang G. Shin
CCGRID
2009
IEEE
15 years 8 months ago
Hierarchical Caches for Grid Workflows
From personal software to advanced systems, caching mechanisms have steadfastly been a ubiquitous means for reducing workloads. It is no surprise, then, that under the grid and clu...
David Chiu, Gagan Agrawal
DSN
2004
IEEE
15 years 7 months ago
FRTR: A Scalable Mechanism for Global Routing Table Consistency
This paper presents a scalable mechanism, Fast Routing Table Recovery (FRTR), for detecting and correcting route inconsistencies between neighboring BGP routers. The large size of...
Lan Wang, Daniel Massey, Keyur Patel, Lixia Zhang
AAAI
2008
15 years 6 months ago
From Comparing Clusterings to Combining Clusterings
This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, whic...
Zhiwu Lu, Yuxin Peng, Jianguo Xiao
IWCMC
2010
ACM
15 years 6 months ago
On the use of random neural networks for traffic matrix estimation in large-scale IP networks
Despite a large body of literature and methods devoted to the Traffic Matrix (TM) estimation problem, the inference of traffic flows volume from aggregated data still represents a ...
Pedro Casas, Sandrine Vaton