We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...
In this paper, we propose a new framework for online handwritten mathematical expression recognition. The proposed architecture aims at handling mathematical expression recognitio...
The Semantic Web and its technologies become increasingly important. As more and more Semantic Web applications are being used, developing more stable Semantic Web applications be...
It is generally agreed that an on-line recognition system is always reliable than an off-line one. It is due to the availability of the dynamic information, especially the writing...