New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
A compiler approach for generating low-level computer code from high-level input for discontinuous Galerkin finite element forms is presented. The input language mirrors convention...
This paper presents a unified approach to the problem of blind separation of sources, based on the concept of mutual information. This concept is applied to the whole source sequen...
Abstract. On product domains, sparse-grid approximation yields optimal, dimension-independent convergence rates when the function that is approximated has L2-bounded mixed derivati...