Sciweavers

1542 search results - page 61 / 309
» The metamathematics of random graphs
Sort
View
COCOA
2008
Springer
14 years 11 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
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
15 years 4 months ago
Recommendation via Query Centered Random Walk on K-Partite Graph
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...
CORR
2010
Springer
74views Education» more  CORR 2010»
14 years 10 months ago
A note on the random greedy triangle-packing algorithm
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
Tom Bohman, Alan M. Frieze, Eyal Lubetzky
CCCG
2009
14 years 11 months ago
Rigid Components of Random Graphs
We study the emergence of rigid components in an Erdos-R
Louis Theran
RSA
2006
81views more  RSA 2006»
14 years 9 months ago
On random points in the unit disk
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...
Robert B. Ellis, Xingde Jia, Catherine H. Yan