—Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. For the class of static affine program...
Sven Verdoolaege, Martin Palkovic, Maurice Bruynoo...
With the recent advances in massively parallel programmable processor networks, methods for the infusion of massive MIMD parallelism into programs have become increasingly relevant...
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
Whole page relevance defines how well the surface-level representation of all elements on a search result page and the corresponding holistic attributes of the presentation respon...
Peter Bailey, Nick Craswell, Ryen W. White, Liwei ...
We present a non-traditional retrieval problem we call subtopic retrieval. The subtopic retrieval problem is concerned with finding documents that cover many different subtopics ...
ChengXiang Zhai, William W. Cohen, John D. Laffert...