Sciweavers

208 search results - page 27 / 42
» Parallel Algorithms for Computing Temporal Aggregates
Sort
View
OPODIS
2010
13 years 5 months ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas
HPDC
2010
IEEE
13 years 8 months ago
Distributing the power of OLAP
In this paper we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data over an unstructured Peer-to-Peer overlay, wit...
Katerina Doka, Dimitrios Tsoumakos, Nectarios Kozi...
ICALP
2009
Springer
14 years 8 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
GCC
2003
Springer
14 years 28 days ago
Improving Topology-Aware Routing Efficiency in Chord
Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we pres...
Dongfeng Chen, Shoubao Yang
DEBS
2010
ACM
13 years 11 months ago
Predictive publish/subscribe matching
A new publish/subscribe capability is presented: the ability to predict the likelihood that a subscription will be matched at some point in the future. Composite subscriptions con...
Vinod Muthusamy, Haifeng Liu, Hans-Arno Jacobsen