Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,213,899 papers from all fields of science
Search
Sign In
Create Free Account
Precomputation
Known as:
Pre-computation
, Pre-computing
, Precomputed
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Algorithmic efficiency
Approximation algorithm
CPU cache
Collision detection
Expand
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
Christoph H. Lampert
,
H. Nickisch
,
S. Harmeling
IEEE Conference on Computer Vision and Pattern…
2009
Corpus ID: 10301835
We study the problem of object classification when training and test classes are disjoint, i.e. no training examples of the…
Expand
Highly Cited
2004
Highly Cited
2004
SPADE: An Efficient Algorithm for Mining Frequent Sequences
Mohammed J. Zaki
Machine-mediated learning
2004
Corpus ID: 5387869
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem…
Expand
Highly Cited
2004
Highly Cited
2004
Active Appearance Models Revisited
I. Matthews
,
S. Baker
International Journal of Computer Vision
2004
Corpus ID: 204705
Active Appearance Models (AAMs) and the closely related concepts of Morphable Models and Active Blobs are generative models of a…
Expand
Highly Cited
2003
Highly Cited
2003
Video Google: a text retrieval approach to object matching in videos
Josef Sivic
,
Andrew Zisserman
Proceedings Ninth IEEE International Conference…
2003
Corpus ID: 14457153
We describe an approach to object and scene retrieval which searches for and localizes all the occurrences of a user outlined…
Expand
Highly Cited
2001
Highly Cited
2001
Speculative precomputation: long-range prefetching of delinquent loads
J. Collins
,
Hong Wang
,
+4 authors
John Paul Shen
Proceedings 28th Annual International Symposium…
2001
Corpus ID: 1263144
This paper explores Speculative Precomputation, a technique that uses idle thread contexts in a multithreaded architecture to…
Expand
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…
Expand
Highly Cited
1999
Highly Cited
1999
Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation
J. C. López-Hernández
,
R. Dahab
Workshop on Cryptographic Hardware and Embedded…
1999
Corpus ID: 18383931
This paper describes an algorithm for computing elliptic scalar multiplications on non-supersingular elliptic curves defined over…
Expand
Highly Cited
1994
Highly Cited
1994
More Flexible Exponentiation with Precomputation
C. Lim
,
P. 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…
Expand
Highly Cited
1994
Highly Cited
1994
Fast volume rendering using a shear-warp factorization of the viewing transformation
P. Lacroute
,
M. 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…
Expand
Highly Cited
1994
Highly Cited
1994
Precomputation-based Sequential Logic Optimization For Low Power
M. Alidina
,
J. Monteiro
,
S. Devadas
,
Abhijit Ghosh
,
M. Papaefthymiou
IEEE/ACM International Conference on Computer…
1994
Corpus ID: 8836433
We address the problem of optimizing logic-level sequential circuits for low power. We present a powerful sequential logic…
Expand
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)
ACCEPT & CONTINUE