Sciweavers

67 search results - page 8 / 14
» Succinct Representations of Arbitrary Graphs
Sort
View
OOPSLA
1999
Springer
14 years 27 days ago
The Generic Graph Component Library
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
NDSS
2008
IEEE
14 years 3 months ago
HookFinder: Identifying and Understanding Malware Hooking Behaviors
Installing various hooks into the victim system is an important attacking strategy employed by malware, including spyware, rootkits, stealth backdoors, and others. In order to def...
Heng Yin, Zhenkai Liang, Dawn Song
LICS
1997
IEEE
14 years 6 days ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
ICASSP
2009
IEEE
14 years 3 months ago
Energy-efficient graph-based wavelets for distributed coding in Wireless Sensor Networks
This work presents a class of unidirectional lifting-based wavelet transforms for an arbitrary communication graph in a wireless sensor network. These transforms are unidirectiona...
Godwin Shen, Sundeep Pattem, Antonio Ortega
VIZSEC
2004
Springer
14 years 2 months ago
Managing attack graph complexity through visual hierarchical aggregation
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
Steven Noel, Sushil Jajodia