2861 search results - page 147 / 573 » Parallel Online Learning |
122
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
120
Voted
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
120
click to vote
DCOSS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We have developed a new on-line error modeling and optimizationbased localization approach for sensor networks in the presence of distance measurement noise. The approach...
111
Voted
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
123
click to vote
ICA3PP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Deploying lightweight tasks on grid resources would let the communication overhead dominate the overall application processing time. Our aim is to increase the resulting ...