Sciweavers

1007 search results - page 144 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
15 years 7 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
137
Voted
ICDCN
2009
Springer
15 years 9 months ago
Flooding-Assisted Threshold Assignment for Aggregate Monitoring in Sensor Networks
The research community has witnessed a large interest in monitoring large scale distributed systems. In these applications typically we wish to monitor a global system condition wh...
Ali Abbasi, Ahmad Khonsari, Mohammad Sadegh Talebi
ICPP
2008
IEEE
15 years 9 months ago
Fast Source Switching for Gossip-Based Peer-to-Peer Streaming
In this paper we consider gossip-based Peer-to-Peer streaming applications where multiple sources exist and they work serially. More specifically, we tackle the problem of fast s...
Zhenhua Li, Jiannong Cao, Guihai Chen, Yan Liu
WSC
1997
15 years 3 months ago
Minimum Cost Adaptive Synchronization: Experiments with the ParaSol System
We present a novel adaptive synchronization algorithm, called the minimum average cost (MAC) algorithm, in the context of the ParaSol parallel simulation system. ParaSol is a mult...
Edward Mascarenhas, Felipe Knop, Vernon Rego
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
16 years 2 months ago
Efficient xml data dissemination with piggybacking
Content-based dissemination of XML data using the publishsubscribe paradigm is an effective means to deliver relevant data to interested data consumers. To meet the performance ch...
Chee Yong Chan, Yuan Ni