861 search results - page 7 / 173 » Polymorphic Time Systems for Estimating Program Complexity |
95
Voted
ICFP
2004
ACM
15 years 11 months ago
2004
ACM
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
85
Voted
RAID
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Network worms are malicious programs that spread automatically across networks by exploiting vulnerabilities that affect a large number of hosts. Because of the speed at...
86
Voted
FPCA
1989
15 years 3 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
98
Voted
RTAS
2006
IEEE
15 years 5 months ago
2006
IEEE
The evolution of battery technology is not being able to keep up with the increasing performance demand of mobile embedded systems. Therefore, battery life has become an important...
52
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
—We present two Maximum Likelihood (ML) based estimators for Non-Data-Aided (NDA) symbol timing recovery in MIMO systems. These estimators are based on the classical Unconditiona...