In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Abstract-- Multi-context FPGAs (MC-FPGAs) have multiple memory bits per configuration bit forming configuration planes for fast switching between contexts. The additional memory pl...
In word sense disambiguation, choosing the most frequent sense for an ambiguous word is a powerful heuristic. However, its usefulness is restricted by the availability of sense-an...
In this paper, we propose a recursive Taylor method for ray-casting algebraic surfaces. The performance of this approach is compared with four other candidate approaches to raycas...
Huahao Shou, Wenhao Song, Jie Shen, Ralph Martin, ...
This article presents a Support Vector Machine (SVM) like learning system to handle multi-label problems. Such problems are usually decomposed into many two-class problems but the...