Sciweavers

4679 search results - page 419 / 936
» Modeling When Connections Are the Problem
Sort
View
MDM
2007
Springer
195views Communications» more  MDM 2007»
16 years 28 days ago
BORA: Routing and Aggregation for Distributed Processing of Spatio-Temporal Range Queries
This work tackles the problem of answer-aggregation for continuous spatio-temporal range queries in distributed settings. We assume a grid-like coverage of the spatial universe of...
Goce Trajcevski, Hui Ding, Peter Scheuermann, Isab...
IPPS
2005
IEEE
16 years 12 days ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader
SPAA
2005
ACM
16 years 11 days ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
INFOCOM
2002
IEEE
15 years 11 months ago
TCP-SMO: Extending TCP to Support Medium-Scale Multicast Applications
Abstract—Scalable reliable multicast protocols have been a focus of recent research, tackling the problem of efficient reliable data delivery to an arbitrarily large number of r...
Sam Liang, David R. Cheriton
185
Voted
ECSQARU
2001
Springer
15 years 11 months ago
Social Choice, Merging, and Elections
Abstract. Intelligent agents have to be able to merge inputs received from different sources in a coherent and rational way. Recently, several proposals have been made for the merg...
Thomas Andreas Meyer, Aditya Ghose, Samir Chopra