Sciweavers

146 search results - page 21 / 30
» A new characterization of P6-free graphs
Sort
View
IFIP
2010
Springer
13 years 2 months ago
Information Flow Analysis via Path Condition Refinement
We present a new approach to information flow control (IFC), ploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existi...
Mana Taghdiri, Gregor Snelting, Carsten Sinz
KAIS
2010
139views more  KAIS 2010»
13 years 6 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
CVPR
2012
IEEE
11 years 10 months ago
Sum-product networks for modeling activities with stochastic structure
This paper addresses recognition of human activities with stochastic structure, characterized by variable spacetime arrangements of primitive actions, and conducted by a variable ...
Mohamed R. Amer, Sinisa Todorovic
VEE
2012
ACM
187views Virtualization» more  VEE 2012»
12 years 3 months ago
DDGacc: boosting dynamic DDG-based binary optimizations through specialized hardware support
Dynamic Binary Translators (DBT) and Dynamic Binary Optimization (DBO) by software are used widely for several reasons including performance, design simplification and virtualiza...
Demos Pavlou, Enric Gibert, Fernando Latorre, Anto...
RAID
2005
Springer
14 years 1 months ago
Polymorphic Worm Detection Using Structural Information of Executables
Abstract. Network worms are malicious programs that spread automatically across networks by exploiting vulnerabilities that affect a large number of hosts. Because of the speed at...
Christopher Krügel, Engin Kirda, Darren Mutz,...