Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
The snapshot of a word means the most informative fragment of the word. By taking the snapshot instead of the whole, the value space of the lexical feature can be significantly r...
In this paper, we present a deterministic dependency structure analyzer for Chinese. This analyzer implements two algorithms – Yamada and Nivre models – and two sorts of class...
Abstract. Hints are an important ingredient of natural language tutorial dialogues. Existing models of hints, however, are limited in capturing their various underlying functions, ...