Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,250,719 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
2017
Highly Cited
2017
A Computationally Efficient Lookup Table Based FCS-MPC for PMSM Drives Fed by Matrix Converters
M. Siami
,
D. Khaburi
,
M. Rivera
,
José R. Rodríguez
IEEE transactions on industrial electronics…
2017
Corpus ID: 6135142
Finite control set-model predictive control (FCS-MPC) is an interesting alternative for the control of drive systems. However…
Expand
Highly Cited
2012
Highly Cited
2012
A scalable peer-to-peer lookup protocol for Internet applications
Gade Krishna
2012
Corpus ID: 64185630
while peer-to-peer networks are mainly used to locate unique resources across the Internet, new interesting deployment scenarios…
Expand
Highly Cited
2006
Highly Cited
2006
MODIS leaf area index products: from validation to algorithm improvement
Wenze Yang
,
B. Tan
,
+13 authors
R. Myneni
IEEE Transactions on Geoscience and Remote…
2006
Corpus ID: 18305715
Global products of vegetation green Leaf Area Index (LAI) and Fraction of Photosynthetically Active Radiation absorbed by…
Expand
Highly Cited
2004
Highly Cited
2004
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
David R Karger
,
M. Ruhl
ACM Symposium on Parallelism in Algorithms and…
2004
Corpus ID: 2327234
Load balancing is a critical issue for the efficient operation of peer-to-peer (P2P) networks. We give two new load-balancing…
Expand
Highly Cited
2003
Highly Cited
2003
Load Balancing in Structured P2P Systems
A. Rao
,
K. Lakshminarayanan
,
S. Surana
,
R. Karp
,
I. Stoica
International Workshop on Peer-to-Peer Systems
2003
Corpus ID: 881227
Most P2P systems that provide a DHT abstraction distribute objects among “peer nodes” by choosing random identifiers for the…
Expand
Highly Cited
2002
Highly Cited
2002
Anthill: a framework for the development of agent-based peer-to-peer systems
Özalp Babaoglu
,
Hein Meling
,
A. Montresor
Proceedings 22nd International Conference on…
2002
Corpus ID: 6042644
Recent peer-to-peer (P2P) systems are characterized by decentralized control, large scale and extreme dynamism of their operating…
Expand
Highly Cited
2001
Highly Cited
2001
On the effectiveness of DNS-based server selection
A. Shaikh
,
Renu Tewari
,
Mukesh Agrawal
Proceedings IEEE INFOCOM . Conference on Computer…
2001
Corpus ID: 1088209
The rapid growth of the Internet in users and content has fueled extensive efforts to improve the user's overall Internet…
Expand
Highly Cited
1997
Highly Cited
1997
Statistics For Strontium Isotope Stratigraphy: A Robust Lowess Fit to the Marine Sr‐Isotope Curve For 0 to 206 Ma, With Look‐Up Table For Derivation of Numeric Age
R. Howarth
,
J. McArthur
The Journal of geology
1997
Corpus ID: 67835947
We provide a best‐fit curve to 1849 strontium isotope data for the period 0 to 206 Ma using the LOcally‐WEighted regression…
Expand
Highly Cited
1994
Highly Cited
1994
ZCS: A Zeroth Level Classifier System
Stewart W. Wilson
Evolutionary Computation
1994
Corpus ID: 17680778
A basic classifier system, ZCS, is presented that keeps much of Holland's original framework but simplifies it to increase…
Expand
Highly Cited
1991
Highly Cited
1991
Chortle-crf: fast technology mapping for lookup table-based FPGAs
R. Francis
,
Jonathan Rose
,
Z. Vranesic
28th ACM/IEEE Design Automation Conference
1991
Corpus ID: 7348924
A new technology mapping algorithm for lookup tablebased Field Programmable Gate Arrays (FPGA) is presented. The major innovation…
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