Sciweavers

1923 search results - page 210 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ICC
2007
IEEE
126views Communications» more  ICC 2007»
15 years 4 months ago
Severely Fading MIMO Channels: Models and Mutual Information
— In most wireless communications research, the channel models considered experience less severe fading than the classic Rayleigh fading case. In this work, however, we investiga...
Seung Ho Choi, Peter Smith, Ben Allen, Wasim Q. Ma...
ASWSD
2006
Springer
15 years 1 months ago
Generating Sound and Resource-Aware Code from Hybrid Systems Models
Modern real-time embedded systems are complex, distributed, feature-rich applications. Model-based development of real-time embedded systems promises to simplify and accelerate the...
Madhukar Anand, Sebastian Fischmeister, Jesung Kim...
ICDCS
2010
IEEE
15 years 1 months ago
Quantifying and Querying Network Reachability
—Quantifying and querying network reachability is important for security monitoring and auditing as well as many aspects of network management such as troubleshooting, maintenanc...
Amir R. Khakpour, Alex X. Liu
IPPS
2006
IEEE
15 years 4 months ago
Schedulability analysis of non-preemptive recurring real-time tasks
The recurring real-time task model was recently proposed as a model for real-time processes that contain code with conditional branches. In this paper, we present a necessary and ...
Sanjoy K. Baruah, Samarjit Chakraborty
ISSTA
2012
ACM
13 years 14 days ago
A quantitative study of accuracy in system call-based malware detection
Over the last decade, there has been a significant increase in the number and sophistication of malware-related attacks and infections. Many detection techniques have been propos...
Davide Canali, Andrea Lanzi, Davide Balzarotti, Ch...