Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Carry (arithmetic)

Known as: Carry, Carry (mathematics) 
In elementary arithmetic, a carry is a digit that is transferred from one column of digits to another column of more significant digits. It is part… Expand
Wikipedia

Related topics

Related topics

25 relations
Adder (electronics)Adjust flagAlgorithmArithmetic logic unit
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
CommanderSong: A Systematic Approach for Practical Adversarial Voice Recognition
The popularity of ASR (automatic speech recognition) systems, like Google Voice, Cortana, brings in security concerns, as… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
2014
2014
In Vitro Screening of α-Amylase Inhibition by Selected Terpenes from Essential Oils
Purpose: To assess some terpenes from herbal products for possible inhibitory effects on serum αamylase in order to ascertain… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
2013
2013
Semantic interpretation of noun compounds using verbal and other paraphrases
We study the problem of semantic interpretation of noun compounds such as bee honey, malaria mosquito, apple cake, and stem cell… Expand
  • table I
  • table II
  • table III
  • table IV
  • table V
Highly Cited
2010
Highly Cited
2010
Yield Curve Predictors of Foreign Exchange Returns
In a no-arbitrage framework, any variable that affects the pricing of the domestic yield curve has the potential to predict… Expand
  • table 3
  • table 5
  • table 7
  • figure 1
  • figure 2
Highly Cited
2009
Highly Cited
2009
Practical Mitigations for Timing-Based Side-Channel Attacks on Modern x86 Processors
This paper studies and evaluates the extent to which automated compiler techniques can defend against timing-based side-channel… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
Highly Cited
2008
Highly Cited
2008
Noun Compound Interpretation Using Paraphrasing Verbs: Feasibility Study
The paper addresses an important challenge for the automatic processing of English written text: understanding noun compounds… Expand
  • table 1
  • table 2
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1999
Highly Cited
1999
Pattern Search Algorithms for Bound Constrained Minimization
We present a convergence theory for pattern search methods for solving bound constrained nonlinear programs. The analysis relies… Expand
  • figure 1
  • figure 2
Highly Cited
1998
Highly Cited
1998
High-performance carry chains for FPGAs
Carry chains are an important consideration for most computations, including FPGAs. Current FPGAs dedicate a portion of their… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
1988
1988
Approaching a nanosecond: a 32 bit adder
The authors describe a high performance 32-bit binary adder designed at Stanford University. Measurements indicate that the adder… Expand
1959
1959
Parallel addition in digital computers: a new fast 'carry' circuit
 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE