101 search results - page 21 / 21 » Fast approximation of the permanent for very dense problems |
143
click to vote
NIPS
2004
15 years 2 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...