524 search results - page 18 / 105 » Context Trees |
83
Voted
ECML
2003
Springer
15 years 6 months ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
93
Voted
DCC
2004
IEEE
16 years 10 days ago
2004
IEEE
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
103
Voted
VIS
2004
IEEE
16 years 2 months ago
2004
IEEE
Reliable and complete blood-vessel segmentation is still a challenging problem. This is especially true in the presence of morphologic changes resulting from atherosclerotic disea...
103
click to vote
CADUI
2004
15 years 2 months ago
2004
Abstract This paper shows a technique that allows adaptive user interfaces, spanning multiple devices, to be rendered from the task specification at runtime taking into account the...
JALC
2007
15 years 20 days ago
2007
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...