Existing grammar frameworks do not work out particularly well for controlled natural languages (CNL), especially if they are to be used in predictive editors. I introduce in this p...
We prove a strong Symmetry of Information relation for random strings (in the sense of Kolmogorov complexity) and establish tight bounds on the amount on nonuniformity that is nec...
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
For single-carrier systems with frequency domain equalization, decision feedback equalization (DFE) performs better than linear equalization and has much lower computational compl...
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star ...
The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined ...
Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey
Modeling the behavior of imperfect agents from a small number of observations is a difficult, but important task. In the singleagent decision-theoretic setting, inverse optimal co...
Understanding how users tailor their SPARQL queries is crucial when designing query evaluation engines or fine-tuning RDF stores with performance in mind. In this paper we analyz...