2079 search results - page 227 / 416 » Universality of random graphs |
231
click to vote
APPROX
2000
Springer
15 years 11 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
148
click to vote
SIGCSE
2000
ACM
15 years 11 months ago
2000
ACM
We describe a Web-based interactive system, called PILOT, for testing computer science concepts. The strengths of PILOT are its universal access and platform independence, its use...
122
click to vote
NPL
2008
15 years 6 months ago
2008
In this paper, the problem of residual variance estimation is examined. The problem is analyzed in a general setting which covers non-additive heteroscedastic noise under non-iid s...
165
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
175
click to vote
SIGCOMM
2006
ACM
16 years 15 days ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...