Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
Abstract--This paper provides a systematic mutual information (MI) and multichannel beamforming (MBF) characterization of optimized multiple-input multiple-output (MIMO) communicat...
Michail Matthaiou, Paul de Kerret, George K. Karag...
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
Linear Discriminant Analysis (LDA) is one of the wellknown methods for supervised dimensionality reduction. Over the years, many LDA-based algorithms have been developed to cope w...
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...