Sciweavers

310 search results - page 18 / 62
» Randomized Binary Search Trees
Sort
View
CEC
2003
IEEE
14 years 1 months ago
Phylogenetic trees using evolutionary search: initial progress in extending Gaphyl to work with genetic data
AbstractGaphyl is an application of evolutionary algorithms (EA's) to phylogenetics, an approach used by biologists to investigate evolutionary relationships among organisms. ...
Clare Bates Congdon, Kevin J. Septor
TWC
2008
112views more  TWC 2008»
13 years 9 months ago
Design and Analysis of Cross-Layer Tree Algorithms for Wireless Random Access
In this paper, we develop a random access scheme which combines the widely used binary exponential backoff (BEB) algorithm with a cross-layer tree algorithm (TA) that relies on suc...
Xin Wang, Yingqun Yu, Georgios B. Giannakis
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 10 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
FOCS
2006
IEEE
14 years 3 months ago
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the ...
Christian Borgs, Jennifer T. Chayes, Elchanan Moss...
COMBINATORICA
2011
12 years 9 months ago
Binary subtrees with few labeled paths
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...
Rodney G. Downey, Noam Greenberg, Carl G. Jockusch...