Sciweavers

497 search results - page 85 / 100
» On a Parallel Extended Euclidean Algorithm
Sort
View
PODC
2009
ACM
14 years 8 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
CVPR
2009
IEEE
2115views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Real-Time O(1) Bilateral Filtering
We propose a new bilateral filtering algorithm with computational complexity invariant to filter kernel size, socalled O(1) or constant time in the literature. By showing that a...
Kar-Han Tan, Narendra Ahuja, Qingxiong Yang
SPAA
2006
ACM
14 years 1 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
ICDCS
2000
IEEE
13 years 11 months ago
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
Burkhard Englert, Alexander A. Shvartsman
HPDC
2010
IEEE
13 years 8 months ago
MOON: MapReduce On Opportunistic eNvironments
MapReduce offers a flexible programming model for processing and generating large data sets on dedicated resources, where only a small fraction of such resources are every unavaila...
Heshan Lin, Xiaosong Ma, Jeremy S. Archuleta, Wu-c...