• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 35 matches

• 1993
• 
  Jean-Claude Bajard, Sylvanus Kla, Jean-Michel Muller:
  BKM: A new hardware algorithm for complex elementary functions. IEEE Symposium on Computer Arithmetic 1993: 146-153
• 
  Mohand Ourabah Benouamer, P. Jaillon, Dominique Michelucci, Jean-Michel Moreau:
  A lazy exact arithmetic. IEEE Symposium on Computer Arithmetic 1993: 242-249
• 
  Sami S. Bizzan, Graham A. Jullien, Neil M. Wigley, William C. Miller:
  Integer mapping architectures for the polynomial ring engine. IEEE Symposium on Computer Arithmetic 1993: 44-51
• 
  W. S. Briggs, David W. Matula:
  A 17 × 69 bit multiply and add unit with redundant binary feedback and single cycle latency. IEEE Symposium on Computer Arithmetic 1993: 163-170
• 
  Thomas K. Callaway, Earl E. Swartzlander Jr.:
  Estimating the power consumption of CMOS adders. IEEE Symposium on Computer Arithmetic 1993: 210-216
• 
  Jordi Cortadella, Tomás Lang:
  Division with speculation of quotient digits. IEEE Symposium on Computer Arithmetic 1993: 87-94
• 
  Luigi Dadda, Vincenzo Piuri, Renato Stefanelli:
  Multi-parallel convolvers. IEEE Symposium on Computer Arithmetic 1993: 70-77
• 
  Marc Daumas, David W. Matula:
  Design of a fast validated dot product operation. IEEE Symposium on Computer Arithmetic 1993: 62-69
• 
  James Demmel, Xiaoye S. Li:
  Faster numerical algorithms via exception handling. IEEE Symposium on Computer Arithmetic 1993: 234-241
• 
  David Eisig, Josh Rotstain, Israel Koren:
  The design of a 64-bit integer multiplier/divider unit. IEEE Symposium on Computer Arithmetic 1993: 171-178
• 
  Milos D. Ercegovac, Tomás Lang, Paolo Montuschi:
  Very high radix division with selection by rounding and prescaling. IEEE Symposium on Computer Arithmetic 1993: 112-119
• 
  Daniel Etiemble, Keivan Navi:
  Algorithms and multi-valued circuits for the multioperand addition in the binary stored-carry number system. IEEE Symposium on Computer Arithmetic 1993: 194-201
• 
  Gerben J. Hekstra, Ed F. Deprettere:
  Floating point Cordic. IEEE Symposium on Computer Arithmetic 1993: 130-137
• 
  Nariankadu D. Hemkumar, Joseph R. Cavallaro:
  Efficient complex matrix transformations with CORDIC. IEEE Symposium on Computer Arithmetic 1993: 122-129
• 
  Tudor Jebelean:
  Comparing several GCD algorithms. IEEE Symposium on Computer Arithmetic 1993: 180-185
• 
  W. Kenneth Jenkins, Bernard A. Schnaufer, Andrew J. Mansen:
  Combined system-level redundancy and modular arithmetic for fault tolerant digital signal processing. IEEE Symposium on Computer Arithmetic 1993: 28-35
• 
  B. J. Kirsch, Peter R. Turner:
  Adaptive beamforming using RNS arithmetic. IEEE Symposium on Computer Arithmetic 1993: 36-43
• 
  Peter Kornerup:
  High-radix modular multiplication for cryptosystems. IEEE Symposium on Computer Arithmetic 1993: 277-283
• 
  Werner Krandick, Jeremy R. Johnson:
  Efficient multiprecision floating point multiplication with optimal directional rounding. IEEE Symposium on Computer Arithmetic 1993: 228-233
• 
  David M. Lewis:
  An accurate LNS arithmetic unit using interleaved memory function interpolator. IEEE Symposium on Computer Arithmetic 1993: 2-9
• 
  Marianne E. Louie, Milos D. Ercegovac:
  On digit-recurrence division implementations for field programmable gate arrays. IEEE Symposium on Computer Arithmetic 1993: 202-209
• 
  Daniel W. Lozier:
  An underflow-induced graphics failure solved by SLI arithmetic. IEEE Symposium on Computer Arithmetic 1993: 10-17
• 
  Stephen E. McQuillan, John V. McCanny, Robert Hamill:
  New algorithms and VLSI architectures for SRT division and square root. IEEE Symposium on Computer Arithmetic 1993: 80-86
• 
  Jonathon David Mellott, Jermy C. Smith, Fred J. Taylor:
  The Gauss machine: A Galois-enhanced quadratic residue number system systolic array. IEEE Symposium on Computer Arithmetic 1993: 156-162
• 
  Xavier Merrheim, Jean-Michel Muller, Hong-Jin Yeh:
  Fast evaluation of polynomials and inverses of polynomials. IEEE Symposium on Computer Arithmetic 1993: 186-192
• 
  Paolo Montuschi, Luigi Ciminiera:
  n × n carry-save multipliers without final addition. IEEE Symposium on Computer Arithmetic 1993: 54-61
• 
  S. E. Richardson:
  Exploiting trivial and redundant computation. IEEE Symposium on Computer Arithmetic 1993: 220-227
• 
  Debjit Das Sarma, David W. Matula:
  Measuring the accuracy of ROM reciprocal tables. IEEE Symposium on Computer Arithmetic 1993: 95-102
• 
  Michael J. Schulte, Earl E. Swartzlander Jr.:
  Exact rounding of certain elementary functions. IEEE Symposium on Computer Arithmetic 1993: 138-145
• 
  Eric M. Schwarz, Michael J. Flynn:
  Hardware starting approximation for the square root operation. IEEE Symposium on Computer Arithmetic 1993: 103-111

skipping 5 more matches