5 search results - page 1 / 1 » Selective memoization |
POPL
2003
ACM
14 years 5 months ago
2003
ACM
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
IPPS
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper we describe the parallelization of a dynamic programming algorithm used to find common RNA secondary structures including pseudoknots and similar structures. The se...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
FGCS
2000
13 years 4 months ago
2000
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
PLDI
2012
ACM
11 years 7 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...