Sciweavers

2635 search results - page 63 / 527
» Computing multihomogeneous resultants using straight-line pr...
Sort
View
IPPS
2003
IEEE
14 years 3 months ago
Loop Dissevering: A Technique for Temporally Partitioning Loops in Dynamically Reconfigurable Computing Platforms
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...
João M. P. Cardoso
PLDI
2000
ACM
14 years 2 months ago
Caching function calls using precise dependencies
This paper describes the implementation of a purely functional programming language for building software systems. In this language, external tools like compilers and linkers are ...
Allan Heydon, Roy Levin, Yuan Yu
ISSRE
2006
IEEE
14 years 4 months ago
Memoized Forward Computation of Dynamic Slices
Forward computation of dynamic slices is necessary to support interactive debugging and online analysis of long running programs. However, the overhead of existing forward computi...
Wes Masri, Nagi Nahas, Andy Podgurski
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
14 years 2 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
CIE
2007
Springer
14 years 4 months ago
Speed-Up Theorems in Type-2 Computation
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
Chung-Chih Li