Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
Michael Drmota, Bernhard Gittenberger, Reinhard Ku...
Random forests were introduced as a machine learning tool in Breiman (2001) and have since proven to be very popular and powerful for high-dimensional regression and classificatio...
Abstract—This paper presents a novel zero-sum watermarking game between a detection algorithm and a data hiding adversary. Contrary to previous research, the detection algorithm ...
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Abstract. We develop a statistical mechanical interpretation of algorithmic information theory by introducing the notion of thermodynamic quantities, such as free energy, energy, s...