Sciweavers

282 search results - page 43 / 57
» An Algebraic Method for Analyzing Open-Loop Dynamic Systems
Sort
View
SPAA
1994
ACM
15 years 2 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
WSDM
2009
ACM
148views Data Mining» more  WSDM 2009»
15 years 5 months ago
Information arbitrage across multi-lingual Wikipedia
The rapid globalization of Wikipedia is generating a parallel, multi-lingual corpus of unprecedented scale. Pages for the same topic in many different languages emerge both as a r...
Eytan Adar, Michael Skinner, Daniel S. Weld
TPDS
2010
174views more  TPDS 2010»
14 years 8 months ago
Parallel Two-Sided Matrix Reduction to Band Bidiagonal Form on Multicore Architectures
The objective of this paper is to extend, in the context of multicore architectures, the concepts of tile algorithms [Buttari et al., 2007] for Cholesky, LU, QR factorizations to t...
Hatem Ltaief, Jakub Kurzak, Jack Dongarra
100
Voted
WCRE
2006
IEEE
15 years 4 months ago
Animated Visualization of Software History using Evolution Storyboards
The understanding of the structure of a software system can be improved by analyzing the system’s evolution during development. Visualizations of software history that provide o...
Dirk Beyer, Ahmed E. Hassan
PODC
2009
ACM
15 years 10 months ago
Correctness of gossip-based membership under message loss
Due to their simplicity and effectiveness, gossip-based membership protocols have become the method of choice for maintaining partial membership in large P2P systems. A variety of...
Maxim Gurevich, Idit Keidar