17760 search results - page 339 / 3552 » A Generalization of the Massey-Ding Algorithm |
182
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
163
click to vote
ASIACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We use powerful new techniques for list decoding errorcorrecting codes to efficiently trace traitors. Although much work has focused on constructing traceability schemes,...
188
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
296
click to vote
CP
2011
Springer
14 years 6 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
175
click to vote
ICIP
1999
IEEE
16 years 8 months ago
1999
IEEE
Researchers are currently more interested in searching for fragments that are similar to a query, than a total data item that is similar to a query; the search interest is for &qu...