Sciweavers

2899 search results - page 102 / 580
» Dynamic Trees in Practice
Sort
View
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 10 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
14 years 3 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...
JCB
2007
92views more  JCB 2007»
13 years 9 months ago
Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances
Reconstructing phylogenetic trees efficiently and accurately from distance estimates is an ongoing challenge in computational biology from both practical and theoretical consider...
Ilan Gronau, Shlomo Moran
IJCM
2002
92views more  IJCM 2002»
13 years 8 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
CORR
2011
Springer
178views Education» more  CORR 2011»
13 years 4 months ago
Anytime Reliable Codes for Stabilizing Plants over Erasure Channels
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
Ravi Teja Sukhavasi, Babak Hassibi