Sciweavers

28888 search results - page 153 / 5778
» Computability and complexity in analysis
Sort
View
ICC
2007
IEEE
121views Communications» more  ICC 2007»
15 years 11 months ago
On the Expected Complexity Analysis of a Generalized Sphere Decoding Algorithm for Underdetermined Linear Communication Systems
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
Ping Wang, Tho Le-Ngoc
NSDI
2004
15 years 6 months ago
Path-Based Failure and Evolution Management
We present a new approach to managing failures and evolution in large, complex distributed systems using runtime paths. We use the paths that requests follow as e through the syst...
Mike Y. Chen, Anthony Accardi, Emre Kiciman, David...
137
Voted
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 5 months ago
Complexity of Data Flow Analysis for Non-Separable Frameworks
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
Bageshri Karkare, Uday P. Khedker
ESSOS
2009
Springer
15 years 8 months ago
Idea: Measuring the Effect of Code Complexity on Static Analysis Results
Abstract. To understand the effect of code complexity on static analysis, thirty-five format string vulnerabilities were studied. We analyzed two code samples for each vulnerabilit...
James Walden, Adam Messer, Alex Kuhl
133
Voted
SMI
2005
IEEE
15 years 10 months ago
Volumetric Data Analysis using Morse-Smale Complexes
The 3D Morse-Smale complex is a fundamental topological construct that partitions the domain of a real-valued function into regions having uniform gradient flow behavior. In this...
Vijay Natarajan, Valerio Pascucci