Sciweavers

38 search results - page 5 / 8
» Benchmarking Domain-Specific Compiler Optimizations for Vari...
Sort
View
TCAD
2008
136views more  TCAD 2008»
13 years 7 months ago
A Geometric Programming-Based Worst Case Gate Sizing Method Incorporating Spatial Correlation
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
Jaskirat Singh, Zhi-Quan Luo, Sachin S. Sapatnekar
ICML
2006
IEEE
14 years 8 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
CJ
1999
126views more  CJ 1999»
13 years 7 months ago
Source Level Static Branch Prediction
The ability to predict the directions of branches, especially conditional branches, is an important problem in modern computer architecture and advanced compilers. Many static and...
W. F. Wong
CGO
2008
IEEE
14 years 1 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
EDBT
2012
ACM
247views Database» more  EDBT 2012»
11 years 10 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...