Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,335,521 papers from all fields of science
Search
Sign In
Create Free Account
Lookup table
Known as:
Table lookup
, Look-up table
, Lookup
Expand
In computer science, a lookup table is an array that replaces runtime computation with a simpler array indexing operation. The savings in terms of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Algorithmic efficiency
Block cipher
Bump mapping
Cache (computing)
Expand
Broader (1)
Computer performance
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Automated directory assistance system - from theory to practice
Dong Yu
,
Y. Ju
,
Ye-Yi Wang
,
G. Zweig
,
A. Acero
Interspeech
2007
Corpus ID: 15316340
Abstract The automated directory assistance system (ADAS) is traditionally formulated as an automatic speech recognition (ASR…
Expand
2006
2006
An improved look-up table predistortion technique for HPA with memory effects in OFDM systems
He Zhi-yong
,
G. Jianhua
,
Geng Shu-jian
,
Wang Gang
2006
Corpus ID: 195704890
It is well known that HPAs (High Power Amplifiers) are inherently nonlinear devices and many researches have focused on the…
Expand
Highly Cited
2005
Highly Cited
2005
A fast power loss calculation method for long real time thermal simulation of IGBT modules for a three-phase inverter system
Z. Zhou
,
M. S. Khanniche
,
+4 authors
P. Mawby
EPE
2005
Corpus ID: 114398685
A fast power losses calculation method for long real time thermal simulation of IGBT module for a three-phase inverter system is…
Expand
Highly Cited
2003
Highly Cited
2003
Towards Semantic Web Information Extraction
Borislav Popov
,
A. Kiryakov
,
D. Manov
,
A. Kirilov
,
Damyan Ognyanoff
,
Miroslav Goranov
2003
Corpus ID: 18426229
The approach towards Semantic Web Information Extraction (IE) presented here is implemented in KIM – a platform for semantic…
Expand
Highly Cited
2003
Highly Cited
2003
Interference Analysis for AspectJ
Maximilian Störzer
,
J. Krinke
2003
Corpus ID: 16097814
AspectJ is a language implementing aspect-oriented programming on top of Java. Besides modification of program flow and state…
Expand
Highly Cited
1999
Highly Cited
1999
Design of low-power ROM-less direct digital frequency synthesizer using nonlinear digital-to-analog converter
S. Mortezapour
,
Edward K. F. Lee
IEEE J. Solid State Circuits
1999
Corpus ID: 62563544
A design technique that uses nonlinear digital-to-analog converter (DAC) for implementing low-power direct digital frequency…
Expand
1999
1999
Adaptive channel allocation for wireless PCN
S. Boumerdassi
,
A. Beylot
Mob. Networks Appl.
1999
Corpus ID: 2007884
In cellular networks, forced call terminations due to handoff call blocking are generally more objectionable than new call…
Expand
Highly Cited
1997
Highly Cited
1997
Probability-based collision alerting logic for closely-spaced parallel approach
Brenda D. Carpenter
,
J. Kuchar
1997
Corpus ID: 3483612
A prototype airborne collision alerting logic was developed for aircraft on approach to closely-spaced parallel runways. A novel…
Expand
Highly Cited
1983
Highly Cited
1983
A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultracomputer
E. Fiume
,
A. Fournier
,
L. Rudolph
International Conference on Computer Graphics and…
1983
Corpus ID: 14310429
Popular approaches to speeding up scan conversion often employ parallel processing. Recently, several special-purpose parallel…
Expand
Highly Cited
1981
Highly Cited
1981
Multiple Fault Testing of Large Circuits by Single Fault Test Sets
V. Agarwal
,
A. Fung
IEEE transactions on computers
1981
Corpus ID: 34284123
A general theory is presented in this paper to quantitatively predict the multiple fault coverage capability of single fault…
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