2370 search results - page 17 / 474 » The Characterization of Data-Accumulating Algorithms |
ICASSP
2009
IEEE
14 years 4 months ago
2009
IEEE
This paper analyzes the rate of convergence of greedy gossip with eavesdropping (GGE). In previous work, we proposed GGE, a fast gossip algorithm based on exploiting the broadcast...
TIT
2010
13 years 4 months ago
2010
Belief propagation is shown to be an instance of a hybrid between two projection algorithms in the convex programming literature: Dykstra's algorithm with cyclic Bregman proje...
WG
2007
Springer
14 years 3 months ago
2007
Springer
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...
AE
1999
Springer
14 years 1 months ago
1999
Springer
The performance of decoder-based evolutionary algorithms (EAs) strongly depends on the locality of the used decoder and operators. While many approaches to characterize locality ar...
COCO
1992
Springer
14 years 1 months ago
1992
Springer
We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...