# Significand

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- SIAM J. Comput.
- 2018

An outstanding open question posed by Guha and Indyk in 2006 asks us to characterize metric spaces in which distances can be… (More)

Is this relevant?

2013

2013

- 2013

We provide a non–deterministic quantum protocol that approximates Rx(φ1φ 2 2) using Rx(φ1) and Rx(φ2) and a constant number of… (More)

Is this relevant?

2009

2009

- 19th IEEE Symposium on Computer Arithmetic
- 2009

We present a new method and architecture to merge efficiently IEEE 754-2008 decimal rounding with significand BCD addition and… (More)

Is this relevant?

2005

2005

- IEEE Transactions on Computers
- 2005

We propose a new algorithm to find worst cases for the correct rounding of a mathematical function of one variable. We first… (More)

Is this relevant?

2002

2002

- J. Symb. Comput.
- 2002

Cylindrical algebraic decomposition (CAD) (Collins, 1975; Caviness and Johnson, 1998) requires many very time consuming… (More)

Is this relevant?

2002

2002

- FPT
- 2002

Automatic bitwidth analysis is a key ingredient for highlevel programming of FPGAs and high-level synthesis of VLSI circuits. The… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- 1999

A 640×512 CMOS image sensor with an 8b bit-serial Nyquist rate ADC per 4 pixels achieves 10.5 × 10.5 μm pixel size at 29% fill… (More)

Is this relevant?

1994

1994

- 1994

The back propagation algorithm has been modi ed to work without any multiplications and to tolerate computations with a low… (More)

Is this relevant?

1993

1993

- NIPS
- 1993

Hans Peter Graf AT&T Bell Laboratories Holmdel, NJ 07733 The back propagation algorithm has been modified to work without any… (More)

Is this relevant?

1991

1991

- 1991

Kyoto Common Lisp (KCL for short) is a full implementation of the Common Lisp language. KCL is a highly portable Common Lisp… (More)

Is this relevant?