Sciweavers

2814 search results - page 388 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
COMPGEOM
2010
ACM
14 years 3 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
WWW
2005
ACM
14 years 11 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
COORDINATION
2009
Springer
14 years 11 months ago
Multicore Scheduling for Lightweight Communicating Processes
Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A process-oriented design is typically ...
Carl G. Ritson, Adam T. Sampson, Fred R. M. Barnes
DATE
2009
IEEE
121views Hardware» more  DATE 2009»
14 years 5 months ago
Remote measurement of local oscillator drifts in FlexRay networks
—Distributed systems, especially time-triggered ones, are implementing clock synchronization algorithms to provide and maintain a common view of time among the different nodes. S...
Eric Armengaud, Andreas Steininger
ICDCS
2007
IEEE
14 years 4 months ago
A Weighted Moving Average-based Approach for Cleaning Sensor Data
Nowadays, wireless sensor networks have been widely used in many monitoring applications. Due to the low quality of sensors and random effects of the environment, however, it is ...
Yongzhen Zhuang, Lei Chen 0002, Xiaoyang Sean Wang...