5606 search results - page 272 / 1122 » Randomization Techniques for Graphs. |
184
click to vote
SIGECOM
2006
ACM
16 years 14 days ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
196
click to vote
EMMCVPR
1999
Springer
15 years 10 months ago
1999
Springer
This paper considers the use of the EM-algorithm, combined with mean field theory, for parameter estimation in Markov random field models from unlabelled data. Special attention ...
169
click to vote
DNA
2000
Springer
15 years 10 months ago
2000
Springer
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds...
182
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Constrained random simulation is supported by constraint solvers integrated within simulators. These constraint solvers need to be fast and memory efficient to maintain s...
150
click to vote
INFOCOM
2008
IEEE
16 years 28 days ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...