Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

23 relations
Algorithmic efficiencyApproximation algorithmCPU cacheCollision detection
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Fast Normalized Cross-Correlation
Although it is well known that cross correlation can be efficiently implemented in the transform domain, the normalized form of… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Progressive skyline computation in database systems
The skyline of a d-dimensional dataset contains the points that are not dominated by any other point on all dimensions. Skyline… Expand
  • figure 1
  • figure 2
  • table I
  • table II
  • figure 3
Is this relevant?
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… Expand
  • figure 2
  • figure 3
  • figure 6
  • figure 9
  • figure 10
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Topic-sensitive PageRank
In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using… Expand
  • table 4
  • table 3
  • table 2
  • table 5
  • table 7
Is this relevant?
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 context in a multithreaded architecture to… Expand
  • figure 1
  • table 1
  • table 2
  • figure 3
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Fast volume rendering using a shear-warp factorization of the viewing transformation
Several existing volume rendering algorithms operate by factoring the viewing transformation into a 3D shear parallel to the data… Expand
  • figure 2
  • figure 1
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE