420 search results - page 14 / 84 » Generating random regular graphs |
IEICET
2010
15 years 24 days ago
2010
105
Voted
CORR
2004
Springer
15 years 2 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
129
click to vote
IJCNN
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— The incomplete information about the Web structure causes inaccurate results of various ranking algorithms. In this paper, we propose a solution to this problem by form...
117
click to vote
IJAC
2008
15 years 2 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
126
click to vote
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...