426 search results - page 11 / 86 » The Distribution of Patterns in Random Trees |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
102
click to vote
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
VMV
2008
14 years 11 months ago
2008
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
SPAA
1993
ACM
15 years 1 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
COMBINATORICS
2000
14 years 9 months ago
2000
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning...