Sciweavers

3147 search results - page 479 / 630
» Distributed averaging in dynamic networks
Sort
View
IMC
2005
ACM
16 years 3 days ago
Poisson versus Periodic Path Probing (or, Does PASTA Matter?)
Abstract— The well-known PASTA (“Poisson Arrivals See Time Averages”) property states that, under very general conditions, the fraction of Poisson arrivals that observe an un...
Muhammad Mukarram Bin Tariq, Amogh Dhamdhere, Cons...
SPAA
2003
ACM
15 years 11 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
DEBS
2010
ACM
15 years 9 months ago
Magnet: practical subscription clustering for Internet-scale publish/subscribe
An effective means for building Internet-scale distributed applications, and in particular those involving group-based information sharing, is to deploy peer-to-peer overlay netwo...
Sarunas Girdzijauskas, Gregory Chockler, Ymir Vigf...
EUROPAR
2008
Springer
15 years 8 months ago
Complex Queries for Moving Object Databases in DHT-Based Systems
Abstract. Distributed moving object database servers are a feasible solution to the scalability problem of centralized database systems. In this paper we propose a distributed inde...
Cecilia Hernández, M. Andrea Rodrígu...
JEC
2006
100views more  JEC 2006»
15 years 6 months ago
RC-SIMD: Reconfigurable communication SIMD architecture for image processing applications
During the last two decades, Single Instruction Multiple Data (SIMD) processors have become important architectures in embedded systems for image processing applications. The main ...
Hamed Fatemi, Bart Mesman, Henk Corporaal, Twan Ba...