Sciweavers

1722 search results - page 32 / 345
» On the sample mean of graphs
Sort
View
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
15 years 2 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...
FOCS
2003
IEEE
15 years 3 months ago
A Non-Markovian Coupling for Randomly Sampling Colorings
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...
Thomas P. Hayes, Eric Vigoda
WSC
1998
14 years 11 months ago
LABATCH.2: Software for Statistical Analysis of Simulation Sample Path Data
LABATCH.2 is a collection of computer programs available in C, FORTRAN, and SIMSCRIPT II.5 by anonymous ftp, at http://www.or.unc.edu/gfish/labatch.2.html. It performs statistical...
George S. Fishman
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
15 years 7 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
CIKM
2008
Springer
15 years 5 hour ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...