16513 search results - page 3184 / 3303 » Numerical Analysis Methods |
246
click to vote
POPL
2005
ACM
16 years 3 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
237
click to vote
POPL
2004
ACM
16 years 3 months ago
2004
ACM
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
132
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
142
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
215
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...