Sciweavers

28888 search results - page 144 / 5778
» Computability and complexity in analysis
Sort
View
COMPUTER
2007
80views more  COMPUTER 2007»
13 years 8 months ago
Conquering Complexity
Gerard J. Holzmann
SPAA
2009
ACM
14 years 5 months ago
Brief announcement: low depth cache-oblivious sorting
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifics (cache...
Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardha...
WSC
1998
13 years 9 months ago
A Speculation-based Approach for Performance and Dependability Analysis: A Case Study
In this paper, we propose two speculation-based methods for fast and accurate simulation-based performance and dependability analysis of complex systems, incorporating detailed si...
Yiqing Huang, Zbigniew Kalbarczyk, Ravishankar K. ...
ICC
2009
IEEE
113views Communications» more  ICC 2009»
13 years 5 months ago
Using GMM and SVM-Based Techniques for the Classification of SSH-Encrypted Traffic
When employing cryptographic tunnels such as the ones provided by Secure Shell (SSH) to protect their privacy on the Internet, users expect two forms of protection. First, they aim...
Maurizio Dusi, Alice Este, Francesco Gringoli, Luc...
CDC
2009
IEEE
14 years 26 days ago
Schur-based decomposition for reachability analysis of linear time-invariant systems
— We present a method for complexity reduction in reachability analysis and controller synthesis via a Schur-based decomposition for LTI systems. The decomposition yields either ...
Shahab Kaynama, Meeko Oishi