11 papers:
- SIGMOD-2013-ArmbrustLKFFP #incremental #independence
- Generalized scale independence through incremental precomputation (MA, EL, TK, AF, MJF, DAP), pp. 625–636.
- CIKM-2012-CreceliusS #graph #maintenance #nearest neighbour #scalability
- Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs (TC, RS), pp. 952–961.
- ASE-2011-RabkinK #fault
- Precomputing possible configuration error diagnoses (AR, RHK), pp. 193–202.
- DATE-2010-BorodinJ #detection #fault
- Instruction precomputation with memoization for fault detection (DB, BHHJ), pp. 1665–1668.
- CIKM-2008-NajorkC #analysis #effectiveness #performance
- Efficient and effective link analysis with precomputed salsa maps (MN, NC), pp. 53–62.
- ICEIS-DISI-2007-GroppeGL #order #using
- Using an index of precomputed joins in order to speed up SPARQL processing (SG, JG, VL), pp. 13–20.
- HPCA-2007-ZhangTC #adaptation #thread
- Accelerating and Adapting Precomputation Threads for Effcient Prefetching (WZ, DMT, BC), pp. 85–95.
- PLDI-2002-LiaoWWSHL #adaptation
- Post-Pass Binary Adaptation for Software-Based Speculative Precomputation (SWL, PHW, HW, JPS, GH, DML), pp. 117–128.
- HPCA-2002-WangWCGKS #execution #memory management
- Memory Latency-Tolerance Approaches for Itanium Processors: Out-of-Order Execution vs. Speculative Precomputation (PHW, HW, JDC, EG, RMK, JPS), pp. 187–196.
- CIKM-1993-MehtaGPN #generative #using
- The OODB Path-Method Generator (PMG) Using Precomputed Access Relevance (AM, JG, YP, EJN), pp. 596–605.
- ICALP-1986-Allender
- Characterizations on PUNC and Precomputation (Extended Abstract) (EA), pp. 1–10.