Sciweavers

162 search results - page 10 / 33
» A Relational Approach to the Compilation of Sparse Matrix Pr...
Sort
View
POPL
2004
ACM
14 years 7 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
ISCA
1999
IEEE
105views Hardware» more  ISCA 1999»
13 years 11 months ago
The Program Decision Logic Approach to Predicated Execution
Modern compilers must expose sufficient amounts of Instruction-Level Parallelism (ILP) to achieve the promised performance increases of superscalar and VLIW processors. One of the...
David I. August, John W. Sias, Jean-Michel Puiatti...
TOPLAS
1998
133views more  TOPLAS 1998»
13 years 7 months ago
A Systematic Study of Functional Language Implementations
Abstract: We introduce a unified framework to describe, relate, compare and classify functional language implementations. The compilation process is expressed as a succession of p...
Rémi Douence, Pascal Fradet
SIGMOD
2007
ACM
157views Database» more  SIGMOD 2007»
14 years 7 months ago
Compiling mappings to bridge applications and databases
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the...
Sergey Melnik, Atul Adya, Philip A. Bernstein
MM
2010
ACM
177views Multimedia» more  MM 2010»
13 years 7 months ago
Image tag refinement towards low-rank, content-tag prior and error sparsity
The vast user-provided image tags on the popular photo sharing websites may greatly facilitate image retrieval and management. However, these tags are often imprecise and/or incom...
Guangyu Zhu, Shuicheng Yan, Yi Ma