An effective procedure for automatically acquiring a new set of disambiguation rules for an existing deterministic parser on the basis of tagged text is presented. Performance of ...
—This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing...
The Summary Tree Explorer (STE) is a Java application for interactively exploring sets of phylogenetic trees using two coupled representations: a node-and-link diagram and a textu...
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called f...
Awareness has been extensively studied in human computer interaction (HCI) and computer supported cooperative work (CSCW). The success of many collaborative systems hinges on effe...
Umer Farooq, Craig H. Ganoe, John M. Carroll, Isaa...