39 search results - page 3 / 8 » Sampling Combinatorial Spaces Using Biased Random Walks |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
IMC
2006
ACM
13 years 11 months ago
2006
ACM
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
TC
2008
13 years 5 months ago
2008
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
FOCS
2009
IEEE
13 years 12 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
FGR
2004
IEEE
13 years 8 months ago
2004
IEEE
LDA is a popular subspace based face recognition approach. However, it often suffers from the small sample size problem. When dealing with the high dimensional face data, the LDA ...