Sciweavers

3497 search results - page 341 / 700
» Making Distributed Applications Robust
Sort
View
WWW
2005
ACM
16 years 7 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
16 years 1 months ago
PARINET: A tunable access method for in-network trajectories
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...
SC
2009
ACM
16 years 1 months ago
Highly scalable genome assembly on campus grids
Bioinformatics researchers need efficient means to process large collections of sequence data. One application of interest, genome assembly, has great potential for parallelizati...
Christopher Moretti, Michael Olson, Scott J. Emric...
CCGRID
2008
IEEE
16 years 1 months ago
A Proactive Non-Cooperative Game-Theoretic Framework for Data Replication in Data Grids
— Data grids and its cost effective nature has taken on a new level of interest in recent years; amalgamation of different providers results in increased capacity as well as lowe...
Ali Elghirani, Riky Subrata, Albert Y. Zomaya
MIDDLEWARE
2007
Springer
16 years 27 days ago
Vector-Field Consistency for Ad-Hoc Gaming
Abstract. Developing distributed multiplayer games for ad-hoc networks is challenging. Consistency of the replicated shared state is hard to ensure at a low cost. Current consisten...
Nuno Santos, Luís Veiga, Paulo Ferreira