This paper develops a new model that describes the queueing process of a communication network when data sources use window flow control. The model takes into account the burstines...
Ao Tang, Lachlan L. H. Andrew, Krister Jacobsson, ...
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
embership problem for non-linear Abstract Categorial Grammars Sylvain Salvati Abstract In this paper we show that the membership problem for second order nonbstract Categorial Gram...
In this paper, we develop an RST-style textlevel discourse parser, based on the HILDA discourse parser (Hernault et al., 2010b). We significantly improve its tree-building step b...
This paper proposes a novel visualization approach, which can depict the variations between different human motion data. This is achieved by representing the time dimension of eac...