We study models that characterize pen trajectories of online handwritten characters in a fine manner. We propose radical based fine trajectory hidden Markov models (HMMs), which...
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
When using machine learning for in silico modeling, the goal is normally to obtain highly accurate predictive models. Often, however, models should also bring insights into intere...
Terminologies and other knowledge resources are widely used to aid entity recognition in specialist domain texts. As well as providing lexicons of specialist terms, linkage from t...
Angus Roberts, Robert Gaizasukas, Mark Hepple, Yik...
When teaching concurrency, using a process-oriented language, it is often introduced through a visual representation of programs in the form of process network . These diagrams all...