Sciweavers

10051 search results - page 1691 / 2011
» A Dynamic Separator Algorithm
Sort
View
PLDI
2009
ACM
15 years 10 months ago
Binary analysis for measurement and attribution of program performance
Modern programs frequently employ sophisticated modular designs. As a result, performance problems cannot be identified from costs attributed to routines in isolation; understand...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...
130
Voted
PPPJ
2009
ACM
15 years 10 months ago
Phase detection using trace compilation
Dynamic compilers can optimize application code specifically for observed code behavior. Such behavior does not have to be stable across the entire program execution to be bene...
Christian Wimmer, Marcelo Silva Cintra, Michael Be...
SAC
2009
ACM
15 years 10 months ago
Points-to analysis for JavaScript
JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is ...
Dongseok Jang, Kwang-Moo Choe
SIGMOD
2009
ACM
161views Database» more  SIGMOD 2009»
15 years 10 months ago
Dependency-aware reordering for parallelizing query optimization in multi-core CPUs
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
Wook-Shin Han, Jinsoo Lee
CCS
2009
ACM
15 years 10 months ago
Privacy-preserving genomic computation through program specialization
In this paper, we present a new approach to performing important classes of genomic computations (e.g., search for homologous genes) that makes a significant step towards privacy...
Rui Wang, XiaoFeng Wang, Zhou Li, Haixu Tang, Mich...
« Prev « First page 1691 / 2011 Last » Next »