Sciweavers

16430 search results - page 62 / 3286
» On Computable Tree Functions
Sort
View
IANDC
2008
109views more  IANDC 2008»
13 years 10 months ago
Compositions of extended top-down tree transducers
Abstract. Unfortunately the class of transformations computed by nondeleting and linear extended top-down tree transducers [Graehl, Knight: Training Tree Transducers. HLT-NAACL 200...
Andreas Maletti
FOCS
1998
IEEE
14 years 2 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
MIAR
2006
IEEE
14 years 4 months ago
Cerebral Vascular Tree Matching of 3D-RA Data Based on Tree Edit Distance
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
Tommy W. H. Tang, Albert C. S. Chung
LICS
2007
IEEE
14 years 4 months ago
A Contraction Method to Decide MSO Theories of Deterministic Trees
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
Angelo Montanari, Gabriele Puppis
CVGIP
2004
98views more  CVGIP 2004»
13 years 10 months ago
Topological volume skeletonization and its application to transfer function design
Topological volume skeletonization is a novel approach for automating transfer function design in visualization by extracting the topological structure of a volume dataset. The sk...
Shigeo Takahashi, Yuriko Takeshima, Issei Fujishir...