Sciweavers

946 search results - page 108 / 190
» Spatially-decaying aggregation over a network: model and alg...
Sort
View
TSP
2010
14 years 4 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
EJC
2010
14 years 4 months ago
Modelling a Query Space Using Associations
We all use our associative memory constantly. Words and concepts form paths that we can follow to find new related concepts; for example, when we think about a car we may associate...
Mika Timonen, Paula Silvonen, Melissa Kasari
NSDI
2004
14 years 11 months ago
Designing a DHT for Low Latency and High Throughput
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...
Frank Dabek, Jinyang Li, Emil Sit, James Robertson...
BROADNETS
2007
IEEE
15 years 4 months ago
Design and control of optical grid networks
—Grid computing aims to realize a high-performance computing environment, while increasing the usage efficiency of installed resources. This puts considerable constraints on the...
Marc De Leenheer, Chris Develder, Tim Stevens, Bar...
TPDS
2008
140views more  TPDS 2008»
14 years 9 months ago
High-Performance Resource Allocation and Request Redirection Algorithms for Web Clusters
Abstract-- With increasing richness in features such as personalization of content, web applications are becoming more complex and hence compute intensive. Traditional approaches t...
Supranamaya Ranjan, Edward W. Knightly