Sciweavers

1594 search results - page 10 / 319
» Fast Prediction on a Tree
Sort
View
NETWORKING
2004
13 years 9 months ago
A Case for Mesh-Tree-Interaction in End System Multicasting
Abstract. End System Multicasting (ESM) is fast becoming a feasible alternative to IP multicasting. ESM approaches can be broadly classified into two main categories: (i) Tree firs...
Anirban Chakrabarti, Govindarasu Manimaran
BILDMED
2006
169views Algorithms» more  BILDMED 2006»
13 years 9 months ago
Segmentation of the Vascular Tree in CT Data Using Implicit Active Contours
Abstract. We propose an algorithm for the segmentation of blood vessels in the kind of CT-data typical for diagnostics in a clinical environment. Due to poor quality and variance i...
Karsten Rink, Arne-Michael Törsel, Klaus D. T...
ESA
2009
Springer
112views Algorithms» more  ESA 2009»
14 years 2 months ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...
CADE
2001
Springer
14 years 8 months ago
Context Trees
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela
JCB
2002
108views more  JCB 2002»
13 years 7 months ago
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
Richard Desper, Olivier Gascuel