Recently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probabil...
Alexandre Graell i Amat, Fredrik Brannstrom, Lars ...
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
This paper describes the winning entry to the Omphalos context free grammar learning competition. Our approach integrates an information theoretic constituent likelihood measure to...
—This paper introduces new metrics for course evaluation. It is also proposes a ranking algorithm that classifies courses based on the previous course evaluation metrics and sugg...
Stavros Valsamidis, Ioannis Kazanidis, Sotirios Ko...
A class of extended aggregation operators, called impact functions, is proposed and their basic properties are examined. Some important classes of functions like generalized ordere...