17770 search results - page 224 / 3554 » A Generalization of Forward-Backward Algorithm |
222
Voted
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
161
click to vote
IJCAI
1989
15 years 7 months ago
1989
Explanation-based generalization algorithms need to generalize the structure of their explanations. This is necessary in order to acquire concepts where a recursive or iterative p...
163
click to vote
TCS
2011
15 years 1 months ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
144
Voted
TCOM
2010
15 years 1 months ago
2010
It is shown that binary low-density generator matrix codes can achieve the rate-distortion bound of discrete memoryless sources with general distortion measure via multilevel quant...
183
click to vote
COMSNETS
2012
14 years 2 months ago
2012
—In this paper, we investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a cap...