13214 search results - page 283 / 2643 » Pseudorandomness for network algorithms |
172
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
199
click to vote
WEBI
2007
Springer
16 years 24 days ago
2007
Springer
Detecting densely connected subgroups in graphs such as communities in social networks is of interest in many research fields. Several methods have been developed to find commun...
162
click to vote
ICCI
1993
15 years 10 months ago
1993
A distributed algorithm for finding an ear decomposition of an asynchronous communication network with n nodes and m links is presented in this paper. At the completion of the alg...
177
click to vote
NN
2000
Springer
15 years 6 months ago
2000
Springer
A fundamental problem in neural network research, as well as in many other disciplines, is finding a suitable representation of multivariate data, i.e. random vectors. For reasons...
171
click to vote
CCCG
2008
15 years 8 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...