3049 search results - page 72 / 610 » On the Convergence of Bound Optimization Algorithms |
126
click to vote
WG
1998
Springer
15 years 8 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
124
click to vote
AAECC
2003
Springer
15 years 9 months ago
2003
Springer
We examine 2-dimensional 3-dispersion lattice interleavers in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight...
177
click to vote
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract-- We consider problems where multiple agents cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchan...
133
click to vote
NIPS
2000
15 years 5 months ago
2000
Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed....
119
click to vote
TSP
2008
15 years 4 months ago
2008
Abstract-- Simple and efficient computational algorithms for nonparametric wavelet-based identification of nonlinearities in Hammerstein systems driven by random signals are propos...