In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
In this paper we present a randomized complexity theoretic model for those epidemics propagated via short-distance close contact. We prove that the contact-based epidemics problems...
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
Mixed Group Ranks is a parametric method for combining rank based classiers that is eective for many-class problems. Its parametric structure combines qualities of voting methods...