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.
2016
2016
Compressive Sensing encryption modes and their security
Compressed Sensing may offer confidentiality with a good level of security that comes at limited extra costs. By this means… 
Highly Cited
2014
Highly Cited
2014
Segmentation-free word spotting with exemplar SVMs
Highly Cited
2014
Highly Cited
2014
Online Topic-aware Influence Maximization Queries
Influence maximization is the key algorithmic problem behind viral marketing: it requires to identify a set of influential users… 
Highly Cited
2011
Highly Cited
2011
FPGA Implementations of the AES Masked Against Power Analysis Attacks
Power analysis attacks are a serious treat for implementations of modern cryptographic algorithms. Masking is a particularly… 
Highly Cited
2005
Highly Cited
2005
Feature Combination and Relevance Feedback for 3D Model Retrieval
Retrieval of 3D models have attracted much research interest, and many types of shape features have been proposed. In this paper… 
Highly Cited
2003
Highly Cited
2003
Path-based protection for surviving double-link failures in mesh-restorable optical networks
We consider path-based protection methods for two-link failures in mesh optical networks. Two link-disjoint backup paths are pre… 
1997
1997
Data distribution algorithms for load balanced fault-tolerant Web access
Describes the design and analysis of RobustWeb, a scalable and fault-tolerant World Wide Web server cluster that is based on HTTP… 
Highly Cited
1995
Highly Cited
1995
Computational Kinematic Analysis of Higher Pairs with Multiple Contacts
We present a computational kinematic theory of higher pairs with multiple contacts, including simultaneous contacts, intermittent… 
Highly Cited
1989
Highly Cited
1989
Test set embedding in a built-in self-test environment
  • S. AkersW. Jansz
  • Proceedings. 'Meeting the Tests of Time…
  • 1989
  • Corpus ID: 26431414
The authors describe a built-in self-test (BIST) technique where the on-chip test pattern generator is a binary counter with… 
Highly Cited
1981
Highly Cited
1981
Display Of Three-Dimensional Discrete Surfaces
The currently-existing 3-D imaging technologies provide 3-D digital images of scenes in the form of 3-D arrays of numbers. In the… 
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)