971 search results - page 22 / 195 » Comparative Analysis of Arithmetic Coding Computational Comp... |
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
IPPS
1996
IEEE
13 years 12 months ago
1996
IEEE
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
While many obfuscation schemes proposed, none of them satisfy any strong definition of obfuscation. Furthermore secure generalpurpose obfuscation algorithms have been proven to be...
SAS
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
INFSOF
2002
13 years 7 months ago
2002
Pointer analysis is an important part of source code analysis. Many programs that manipulate source code take points-to sets as part of their input. Points-to related data collect...