Sciweavers

19 search results - page 1 / 4
» Obtaining Optimal k-Cardinality Trees Fast
Sort
View
ALENEX
2008
89views Algorithms» more  ALENEX 2008»
13 years 6 months ago
Obtaining Optimal k-Cardinality Trees Fast
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
JCNS
2010
90views more  JCNS 2010»
12 years 11 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
TCAD
2002
128views more  TCAD 2002»
13 years 4 months ago
Preferred direction Steiner trees
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
Mehmet Can Yildiz, Patrick H. Madden
STACS
1999
Springer
13 years 9 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin
CSB
2004
IEEE
109views Bioinformatics» more  CSB 2004»
13 years 8 months ago
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
Usman Roshan, Bernard M. E. Moret, Tandy Warnow, T...