Sciweavers

2079 search results - page 89 / 416

» Universality of random graphs

116

CPC
2011

170views Education» more CPC 2011»

The Largest Component in Subcritical Inhomogeneous Random Graphs

14 years 11 months ago

The Largest Component in Subcritical Inhomogeneous Random Graphs

Download www.maths.lth.se

Tatyana S. Turova

claim paper

Read More »

131

SIAMDM
2010

102views more SIAMDM 2010»

Hamilton Cycles in Random Graphs with a Fixed Degree Sequence

14 years 11 months ago

Hamilton Cycles in Random Graphs with a Fixed Degree Sequence

Download www.math.cmu.edu

Let d = d1 d2

Colin Cooper, Alan M. Frieze, Michael Krivelevich

claim paper

Read More »

144

GC
2011
Springer

240views Applied Computing» more GC 2011»

Cleaning Random d-Regular Graphs with Brooms

14 years 7 months ago

Cleaning Random d-Regular Graphs with Brooms

Download www.math.ryerson.ca

Pawel Pralat

claim paper

Read More »

163

STOC
2012
ACM

200views Algorithms» more STOC 2012»

The freezing threshold for k-colourings of a random graph

13 years 6 months ago

The freezing threshold for k-colourings of a random graph

Download www.cs.toronto.edu

Michael Molloy

claim paper

Read More »

142

ICML
2004
IEEE

146views Machine Learning» more ICML 2004»

Semi-supervised learning using randomized mincuts

16 years 5 months ago

Semi-supervised learning using randomized mincuts

Download www.aladdin.cs.cmu.edu

In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...

Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...

claim paper

Read More »

« Prev « First page 89 / 416 Last » Next »