Sciweavers

6365 search results - page 290 / 1273
» Fast Local Computation Algorithms
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 8 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
USS
2004
15 years 8 months ago
Very Fast Containment of Scanning Worms
Computer worms -- malicious, self-propagating programs -- represent a significant threat to large networks. One possible defense, containment, seeks to limit a worm's spread ...
Nicholas Weaver, Stuart Staniford, Vern Paxson
CGF
2004
89views more  CGF 2004»
15 years 6 months ago
Fast Multipath Radiosity using Hierarchical Subscenes
This paper presents an efficient acceleration technique for the global line radiosity Multipath method. In this approach, the scene is subdivided in a hierarchy of box bounded sub...
Francesc Castro, Mateu Sbert, László...
CORR
2011
Springer
199views Education» more  CORR 2011»
15 years 1 months ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...
IPPS
2006
IEEE
16 years 21 days ago
Structural and algorithmic issues of dynamic protocol update
In this paper, we study dynamic protocol update (DPU). Contrary to local code updates on-the-fly, DPU requires global coordination of local code replacements. We propose a novel ...
Olivier Rütti, Pawel T. Wojciechowski, Andr&e...