A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
We propose a non-data-aided adaptive beamforming algorithm based on Widely Linear (WL) processing techniques and the Auxiliary Vector Filtering (AVF) algorithm for non-circular si...
Nuan Song, Jens Steinwandt, Lei Wang, Rodrigo C. d...
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
The Bayesian filtering for recursive state estimation and the shape-based matching methods are two of the most commonly used approaches for target tracking. The Multiple Hypothesi...
The problem of automatic recognition of human activities is among the most important and challenging open areas of research in Computer Vision. This paper presents a new approach ...
Arcangelo Distante, I. Gnoni, Marco Leo, Paolo Spa...