— This paper presents an analytical model for the analysis of Hybrid ARQ techniques on Discrete Time Markov Channels by means of Markov chains. The first contribution is an orig...
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Malware continues to remain one of the most important security problems on the Internet today. Whenever an anti-malware solution becomes popular, malware authors typically react p...
Clemens Kolbitsch, Engin Kirda, Christopher Kruege...
This paper introduces a new architecture for automating the generalization of program structure and the recognition of common patterns in the area of malware analysis. By using ma...
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...