2814 search results - page 85 / 563 » Competitive Analysis of Distributed Algorithms |
121
click to vote
VIS
2004
IEEE
16 years 3 months ago
2004
IEEE
A new method for the simplification and the visualization of vector fields is presented based on the notion of Centroidal Voronoi tessellations (CVT's). A CVT is a special Vo...
106
Voted
SAINT
2008
IEEE
15 years 8 months ago
2008
IEEE
An increasing proportion of distributed hash tables (DHTs) maintain additional routing information regarding each node’s immediately surrounding neighbors in a network overlay. ...
115
Voted
TNN
1998
15 years 1 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
111
Voted
ESA
2009
Springer
15 years 8 months ago
2009
Springer
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...
117
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...