3875 search results - page 384 / 775 » Approximation algorithms for the 0-extension problem |
173
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
201
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
197
click to vote
TC
1998
15 years 6 months ago
1998
—Authentication using a path of trusted intermediaries, each able to authenticate the next in the path, is a well-known technique for authenticating channels in a large distribut...
173
click to vote
IACR
2011
14 years 6 months ago
2011
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
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...