Sciweavers

420 search results - page 25 / 84
» Generating random regular graphs
Sort
View
FOCS
2004
IEEE
13 years 11 months ago
Randomly Coloring Constant Degree Graphs
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...
Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, E...
AAAI
2006
13 years 9 months ago
Multi-Conditional Learning: Generative/Discriminative Training for Clustering and Classification
This paper presents multi-conditional learning (MCL), a training criterion based on a product of multiple conditional likelihoods. When combining the traditional conditional proba...
Andrew McCallum, Chris Pal, Gregory Druck, Xuerui ...
COCOA
2008
Springer
13 years 9 months ago
Protean Graphs with a Variety of Ranking Schemes
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat
DMTCS
2006
66views Mathematics» more  DMTCS 2006»
13 years 7 months ago
On randomly colouring locally sparse graphs
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...
Alan M. Frieze, Juan Vera
CVPR
2009
IEEE
15 years 2 months ago
A Revisit of Generative Model for Automatic Image Annotation using Markov Random Fields
Much research effort on Automatic Image Annotation (AIA) has been focused on Generative Model, due to its well formed theory and competitive performance as compared with many we...
Yu Xiang (Fudan University), Xiangdong Zhou (Fudan...