Sciweavers

128 search results - page 20 / 26
» Applying IC-Scheduling Theory to Familiar Classes of Computa...
Sort
View
DASC
2006
IEEE
16 years 2 days ago
On Recognizing Virtual Honeypots and Countermeasures
— Honeypots are decoys designed to trap, delay, and gather information about attackers. We can use honeypot logs to analyze attackers’ behaviors and design new defenses. A virt...
Xinwen Fu, Wei Yu, Dan Cheng, Xuejun Tan, Kevin St...
FMCAD
2008
Springer
15 years 7 months ago
Automatic Non-Interference Lemmas for Parameterized Model Checking
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
Jesse D. Bingham
STACS
2010
Springer
16 years 1 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
SIGCSE
2006
ACM
147views Education» more  SIGCSE 2006»
15 years 12 months ago
Image understanding as a second course in AI: preparing students for research
This paper describes the development and structure of a second course in artificial intelligence that was developed to meet the needs of upper-division undergraduate and graduate ...
Roxanne L. Canosa
EMSOFT
2009
Springer
15 years 10 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond