Sciweavers

613 search results - page 75 / 123
» Time Optimal Self-Stabilizing Spanning Tree Algorithms
Sort
View
WABI
2001
Springer
112views Bioinformatics» more  WABI 2001»
15 years 2 months ago
Finding an Optimal Inversion Median: Experimental Results
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
Adam C. Siepel, Bernard M. E. Moret
RECOMB
2005
Springer
15 years 10 months ago
Rapid Protein Side-Chain Packing via Tree Decomposition
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
Jinbo Xu
ISBRA
2009
Springer
15 years 4 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
PKDD
2010
Springer
178views Data Mining» more  PKDD 2010»
14 years 8 months ago
Large-Scale Support Vector Learning with Structural Kernels
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
Aliaksei Severyn, Alessandro Moschitti
ISAAC
2003
Springer
125views Algorithms» more  ISAAC 2003»
15 years 3 months ago
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof...