2713 search results - page 407 / 543 » Parameterized Tree Systems |
175
click to vote
EJC
2002
15 years 6 months ago
2002
A subgraph H of a graph G is gated if for every x V(G) there exists a vertex u in H such that dG (x, v) = dG (x, u) + d G (u, v) for any v V(H). The gated amalgam of graphs G 1 an...
202
click to vote
ENTCS
2002
15 years 6 months ago
2002
In this paper, we develop the notion of fuzzy unification and incorporate it into a novel fuzzy argumentation framework for extended logic programming. We make the following contri...
156
click to vote
CSL
1999
Springer
15 years 6 months ago
1999
Springer
This paper presents a new approach to speech synthesis in which a set of cross-word decision-tree state-clustered context-dependent hidden Markov models are used to define a set o...
136
click to vote
LISP
1998
15 years 6 months ago
1998
Abstract. RainbowScheme is a visual stepping system that presents Scheme program’s runtime state using icons, colored environment trees, and colored Scheme code. A Scheme program...
173
click to vote
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—In this paper a novel system for automatic detection and segmentation of focal liver lesions in CT images is presented. It utilizes a probabilistic boosting tree to clas...