592 search results - page 41 / 119 » Crossing numbers of random graphs |
172
Voted
MICS
2010
15 years 3 months ago
2010
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
125
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
133
click to vote
CPC
2006
15 years 5 months ago
2006
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
137
Voted
COLT
1999
Springer
15 years 9 months ago
1999
Springer
The empirical error on a test set, the hold-out estimate, often is a more reliable estimate of generalization error than the observed error on the training set, the training estim...
190
Voted
PROPERTYTESTING
2010
15 years 3 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...