Sciweavers

162 search results - page 26 / 33
» A Relational Approach to the Compilation of Sparse Matrix Pr...
Sort
View
POPL
2009
ACM
16 years 9 days ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
118
Voted
PLDI
2004
ACM
15 years 5 months ago
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
John Whaley, Monica S. Lam
SIAMMAX
2010
146views more  SIAMMAX 2010»
14 years 6 months ago
A Comparison of Two-Level Preconditioners Based on Multigrid and Deflation
It is well-known that two-level and multi-level preconditioned conjugate gradient (PCG) methods provide efficient techniques for solving large and sparse linear systems whose coeff...
J. M. Tang, S. P. MacLachlan, Reinhard Nabben, C. ...
93
Voted
ICPR
2000
IEEE
16 years 22 days ago
Image Distance Using Hidden Markov Models
We describe a method for learning statistical models of images using a second-order hidden Markov mesh model. First, an image can be segmented in a way that best matches its stati...
Daniel DeMenthon, David S. Doermann, Marc Vuilleum...
PVM
2004
Springer
15 years 5 months ago
A Refinement Strategy for a User-Oriented Performance Analysis
We introduce a refinement strategy to bring the parallel performance analysis closer to the user. The analysis starts with a simple high-level performance model. It is based on fir...
Jan Lemeire, Andy Crijns, John Crijns, Erik F. Dir...