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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1962-2019
010020030019622019

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Encrypting data in unprotected memory has gained much interest lately for digital rights protection and security reasons. Counter… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We describe an approach to object and scene retrieval which searches for and localizes all the occurrences of a user outlined… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Precomputation-based methods have recently been proposed as an instrument to facilitate scalability, improve response time, and… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Recently, a number of thread-based prefetching techniques have been proposed. These techniques aim at improving the latency of… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A large number of memory accesses in memory-bound applications are irregular, such as pointer dereferences, and can be… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
2001
2001
Previous work on speculative precomputation (SP) on simultaneous multithreaded (SMT) architectures has shown significant benefits… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A major algorithmic challenge posed by QoS routing is the need to promptly identify a suitable path upon a connection request… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper describes an algorithm for computing elliptic scalar multiplications on non-supersingular elliptic curves deened over… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
A new precomputation method is presented for computing gR for a fixed element g and a randomly chosen exponent R in a given group… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
In several crypt,ographic systems, a fixed elcment g of a group (generally z/qz) is repeatedly raised to many different powers… (More)
  • table 1
  • table 2
Is this relevant?