Sciweavers

1095 search results - page 129 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
105
Voted
IPPS
2000
IEEE
15 years 7 months ago
Self-Stabilizing Mutual Exclusion Using Unfair Distributed Scheduler
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explici...
Ajoy Kumar Datta, Maria Gradinariu, Sébasti...
135
Voted
DCOSS
2006
Springer
15 years 6 months ago
Distributed Optimal Estimation from Relative Measurements for Localization and Time Synchronization
Abstract. We consider the problem of estimating vector-valued variables from noisy "relative" measurements. The measurement model can be expressed in terms of a graph, wh...
Prabir Barooah, Neimar Machado da Silva, Joã...
112
Voted
FGCS
2007
86views more  FGCS 2007»
15 years 2 months ago
A grid-based approach for enterprise-scale data mining
Abstract— We describe a grid-based approach for enterprisescale data mining that leverages database technology for I/O parallelism, and on-demand compute servers for compute para...
Ramesh Natarajan, Radu Sion, Thomas Phan
118
Voted
ICS
2010
Tsinghua U.
15 years 7 months ago
Handling task dependencies under strided and aliased references
The emergence of multicore processors has increased the need for simple parallel programming models usable by nonexperts. The ability to specify subparts of a bigger data structur...
Josep M. Pérez, Rosa M. Badia, Jesús...
122
Voted
PODC
2005
ACM
15 years 8 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer