Sciweavers

90 search results - page 7 / 18
» Exploiting Dynamic Independence in a Static Conditioning Gra...
Sort
View
COMCOM
2006
154views more  COMCOM 2006»
13 years 6 months ago
Minimum-cost network hardening using attack graphs
In defending one's network against cyber attack, certain vulnerabilities may seem acceptable risks when considered in isolation. But an intruder can often infiltrate a seemin...
Lingyu Wang, Steven Noel, Sushil Jajodia
RECOMB
2007
Springer
14 years 25 days ago
Network Legos: Building Blocks of Cellular Wiring Diagrams
Publicly-available data sets provide detailed and large-scale information on multiple types of molecular interaction networks in a number of model organisms. These multi-modal univ...
T. M. Murali, Corban G. Rivera
ICASSP
2011
IEEE
12 years 10 months ago
A comparative analysis of dynamic network decoding
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
David Rybach, Ralf Schlüter, Hermann Ney
APCSAC
2005
IEEE
14 years 10 days ago
An Integrated Partitioning and Scheduling Based Branch Decoupling
Conditional branch induced control hazards cause significant performance loss in modern out-of-order superscalar processors. Dynamic branch prediction techniques help alleviate th...
Pramod Ramarao, Akhilesh Tyagi
PRDC
2006
IEEE
14 years 22 days ago
Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
Hakem Beitollahi, Geert Deconinck