2079 search results - page 48 / 416 » Universality of random graphs |
140
click to vote
PKC
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Many applications rely on the security of their random number generator. It is therefore essential that such devices be extensively tested for malfunction. The purpose of...
153
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
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...
157
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
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...
117
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
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...
126
click to vote
CCCG
2009
15 years 5 months ago
2009
We study the emergence of rigid components in an Erdos-R