97 search results - page 2 / 20 » Random Sampling from Pseudo-Ranked B Trees |
COMBINATORICS
2000
13 years 5 months ago
2000
We study the limiting distribution of the height in a generalized trie in which external nodes are capable to store up to b items (the so called b-tries). We assume that such a tr...
CORR
2011
Springer
13 years 10 days ago
2011
Springer
In this paper, we study a simple correlation-based strategy for estimating the unknown delay and amplitude of a signal based on a small number of noisy, randomly chosen frequency-...
COMBINATORICS
2000
13 years 5 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
ECAI
2006
Springer
13 years 9 months ago
2006
Springer
Grafted trees are trees that are constructed using two methods. The first method creates an initial tree, while the second method is used to complete the tree. In this work, the fi...
FOCS
2009
IEEE
14 years 2 days ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...