10890 search results - page 140 / 2178 » Automatic Complexity Analysis |
151
click to vote
FOCS
2005
IEEE
15 years 12 months ago
2005
IEEE
We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the Computable Analysis approach. We then use...
247
click to vote
TSP
2008
15 years 6 months ago
2008
We introduce a framework based on Wirtinger calculus for nonlinear complex-valued signal processing such that all computations can be directly carried out in the complex domain. Th...
295
click to vote
ECOOP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Application frameworks provide reusable concepts that are instantiated in application code through potentially complex implementation steps such as subclassing, implement...
168
click to vote
SAC
2002
ACM
15 years 6 months ago
2002
ACM
This paper presents a novel approach for the problem of generating tiled code for nested for-loops using a tiling transformation. Tiling or supernode transformation has been widel...
181
click to vote
ISCA
2003
IEEE
15 years 11 months ago
2003
IEEE
Meeting deadlines is a key requirement in safe realtime systems. Worst-case execution times (WCET) of tasks are needed for safe planning. Contemporary worst-case timing analysis t...