Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,251,943 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.
2012
2012
OBSERVING SIMULATED PROTOSTARS WITH OUTFLOWS: HOW ACCURATE ARE PROTOSTELLAR PROPERTIES INFERRED FROM SEDs?
S. Offner
,
T. Robitaille
,
Charles E. Hansen
,
C. McKee
,
R. Klein
2012
Corpus ID: 118864061
The properties of unresolved protostars and their local environment are frequently inferred from spectral energy distributions…
Expand
2006
2006
FPGA Implementations of the DES and Triple-DES Masked Against Power Analysis Attacks
François-Xavier Standaert
,
G. Rouvroy
,
J. Quisquater
International Conference on Field-Programmable…
2006
Corpus ID: 12529142
This paper presents FPGA implementations of the DES and Triple-DES with improved security against power analysis attacks. The…
Expand
Highly Cited
2004
Highly Cited
2004
A specific heat ratio model and compression ratio estimation
M. Klein
2004
Corpus ID: 93005001
Cylinder pressure modeling and heat release analysis are today important and standard tools for engineers and researchers, when…
Expand
2002
2002
Test data compression and decompression based on internal scanchains and Golomb coding
A. Chandra
,
K. Chakrabarty
IEEE Trans. Comput. Aided Des. Integr. Circuits…
2002
Corpus ID: 9639265
We present a data compression method and decompression architecture for testing embedded cores in a system-on-a-chip (SOC). The…
Expand
Review
1997
Review
1997
Acoustic indexing for multimedia retrieval and browsing
S. Young
,
Martin G. Brown
,
J. Foote
,
G. Jones
,
Karen Spärck Jones
IEEE International Conference on Acoustics…
1997
Corpus ID: 34196801
This paper reviews the Video Mail Retrieval (VMR) project at Cambridge University and ORL. The VMR project began in September…
Expand
1997
1997
Dynamics of quality-of-service routing with inaccurate link-state information
A. Shaikh
,
J. Rexford
,
K. Shin
IEEE International Conference on Network…
1997
Corpus ID: 15842303
L h2@=i FHTkjml @&?KjnYHQpopqJ@ rsjkTmGtr&FHq o9?AaZGu?A@&@=TmGJ?Aa ] v @=jxwyYZTmI{z|FHjkEA@=l!F jmGtr&B+U'@ Bx@ FHT}r~E F…
Expand
1996
1996
A unifying methodology for intellectual property and custom logic testing
S. Bhatia
,
T. Gheewala
,
P. Varma
Proceedings International Test Conference . Test…
1996
Corpus ID: 31635827
A novel direct access test methodology that unifies the testing of pre-designed intellectual property blocks and custom user…
Expand
Highly Cited
1993
Highly Cited
1993
How To Do Weighted Random Testing For Bist?
Joachim Hartmann
,
Gunter Kemnitz
International Conference on Computer Aided Design
1993
Corpus ID: 62558636
In this paper, a strategy as proposed whach takes into account all aspects of wezghted random testzng for BIST. Our approach…
Expand
1993
1993
Database and display algorithms for interactive visualization of architectural models
T. Funkhouser
,
C. Séquin
1993
Corpus ID: 60622160
This thesis describes a system for interactive walkthroughs of large, fully furnished architectural models. Realistic-looking…
Expand
Highly Cited
1989
Highly Cited
1989
Test set embedding in a built-in self-test environment
S. Akers
,
W. 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…
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