This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
This paper presents a quasi-physically based approach for interactively simulating large-scale dynamic forest scenes under different wind conditions. We introduce theories from th...
Long Zhang, Chengfang Song, Qifeng Tan, Wei Chen, ...
In this paper, we propose a new Tree Switching Protocol (TSP) to reduce multicast routing states required for a forest of multicast trees. The protocol accomplishes this goal by s...
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
Decision trees have been widely used for online learning classification. Many approaches usually need large data stream to finish decision trees induction, as show notable limitat...