The continuous general linear group in n dimensions can be decomposed into two Lie groups: (1) an n(n-1) dimensional ‘Markov type’ Lie group that is defined by preserving the ...
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...
Clustering is an important technique for understanding and analysis of large multi-dimensional datasets in many scientific applications. Most of clustering research to date has be...
—We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we desc...