99 search results - page 1 / 20 » RNC Algorithms for the Uniform Generation of Combinatorial S... |
SODA
1996
ACM
13 years 6 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
ECCV
2006
Springer
14 years 6 months ago
2006
Springer
In recent years, nonlinear dimensionality reduction (NLDR) techniques have attracted much attention in visual perception and many other areas of science. We propose an efficient al...
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...
CPC
2006
13 years 5 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...