Sciweavers

735 search results - page 62 / 147
» A Mechanization of Phylogenetic Trees
Sort
View
JOLLI
2006
101views more  JOLLI 2006»
15 years 22 days ago
A Note on the Expressive Power of Probabilistic Context Free Grammars
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering ...
Gabriel G. Infante López, Maarten de Rijke
112
Voted
CCR
1998
140views more  CCR 1998»
15 years 14 days ago
Policy tree multicast routing: an extension to sparse mode source tree delivery
Bandwidth-sensitive multicast delivery controlled by routing criteria pertinent to the actual traffic flow is very costly in terms of router state and control overhead and it scal...
Horst Hodel
123
Voted
ACMSE
2007
ACM
15 years 4 months ago
Exploring the duality between skip lists and binary search trees
Although skip lists were introduced as an alternative to balanced binary search trees (BSTs), we show that the skip list can be interpreted as a type of randomly-balanced BST whos...
Brian C. Dean, Zachary H. Jones
79
Voted
SAT
2004
Springer
89views Hardware» more  SAT 2004»
15 years 6 months ago
Using Rewarding Mechanisms for Improving Branching Heuristics
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
Elsa Carvalho, João P. Marques Silva
ALMOB
2008
131views more  ALMOB 2008»
15 years 27 days ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas