Sciweavers

2266 search results - page 193 / 454
» Generalizing parametric timing analysis
Sort
View
GLOBECOM
2006
IEEE
15 years 9 months ago
Analytical Investigation with Markov Models of Selective Repeat Type II Hybrid ARQ
— 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...
Leonardo Badia, Marco Levorato, Michele Zorzi
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
15 years 5 months ago
Information dissemination in highly dynamic graphs
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...
Regina O'Dell, Roger Wattenhofer
CCS
2011
ACM
14 years 3 months ago
The power of procrastination: detection and mitigation of execution-stalling malicious code
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...
HICSS
2010
IEEE
185views Biometrics» more  HICSS 2010»
15 years 10 months ago
Concurrent Architecture for Automated Malware Classification
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...
Timothy Daly, Luanne Burns
ICCV
2003
IEEE
16 years 5 months ago
Graph Partition by Swendsen-Wang Cuts
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...
Adrian Barbu, Song Chun Zhu