Skip to search formSkip to main contentSkip to account menu

Precomputation

Known as: Pre-computation, Pre-computing, Precomputed 
In algorithms, precomputation is the act of performing an initial computation before run time to generate a lookup table that can be used by an… 
Wikipedia (opens in a new tab)

Related topics

Related topics

23 relations
Algorithmic efficiencyApproximation algorithmCPU cacheCollision detection

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Learning to detect unseen object classes by between-class attribute transfer
We study the problem of object classification when training and test classes are disjoint, i.e. no training examples of the… 
Highly Cited
2004
Highly Cited
2004
SPADE: An Efficient Algorithm for Mining Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem… 
Highly Cited
2004
Highly Cited
2004
Active Appearance Models Revisited
Active Appearance Models (AAMs) and the closely related concepts of Morphable Models and Active Blobs are generative models of a… 
Highly Cited
2003
Highly Cited
2003
Video Google: a text retrieval approach to object matching in videos
We describe an approach to object and scene retrieval which searches for and localizes all the occurrences of a user outlined… 
Highly Cited
2001
Highly Cited
2001
Speculative precomputation: long-range prefetching of delinquent loads
This paper explores Speculative Precomputation, a technique that uses idle thread contexts in a multithreaded architecture to… 
Review
2001
Review
2001
Answering queries using views: A survey
  • A. Halevy
  • The VLDB journal
  • 2001
  • Corpus ID: 2293639
Abstract. The problem of answering queries using views is to find efficient methods of answering a query using a set of… 
Highly Cited
1999
Highly Cited
1999
Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation
This paper describes an algorithm for computing elliptic scalar multiplications on non-supersingular elliptic curves defined over… 
Highly Cited
1994
Highly Cited
1994
More Flexible Exponentiation with Precomputation
  • C. LimP. Lee
  • Annual International Cryptology Conference
  • 1994
  • Corpus ID: 1723611
A new precomputation method is presented for computing gR for a fixed element g and a randomly chosen exponent R in a given group… 
Highly Cited
1994
Highly Cited
1994
Fast volume rendering using a shear-warp factorization of the viewing transformation
  • P. LacrouteM. Levoy
  • International Conference on Computer Graphics and…
  • 1994
  • Corpus ID: 1266012
Several existing volume rendering algorithms operate by factoring the viewing transformation into a 3D shear parallel to the data… 
Highly Cited
1994
Highly Cited
1994
Precomputation-based Sequential Logic Optimization For Low Power
We address the problem of optimizing logic-level sequential circuits for low power. We present a powerful sequential logic… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)