Sciweavers

598 search results - page 13 / 120
» A random graph model for massive graphs
Sort
View
SAC
2008
ACM
13 years 10 months ago
A mixture model for random graphs
Jean-Jacques Daudin, Franck Picard, Stéphan...
DM
2011
264views Education» more  DM 2011»
13 years 5 months ago
Connectivity threshold and recovery time in rank-based models for complex networks
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
NIPS
2004
14 years 8 days ago
Contextual Models for Object Detection Using Boosted Random Fields
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...
Antonio Torralba, Kevin P. Murphy, William T. Free...
RSA
2008
78views more  RSA 2008»
13 years 10 months ago
How many random edges make a dense hypergraph non-2-colorable?
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
Benny Sudakov, Jan Vondrák