Results 21 to 30 of about 808,804 (331)
IEEE Access, 2018 This paper proposes a hybrid deep neural network (DNN) for automatic speech recognition and an energy-efficient reconfigurable architecture with approximate computing for accelerating the DNN.
Bo Liu +5 more
doaj +1 more source
Computing GCRDs of Approximate Differential Polynomials [PDF]
, 2014 Differential (Ore) type polynomials with approximate polynomial coefficients are introduced. These provide a useful representation of approximate differential operators with a strong algebraic structure, which has been used successfully in the exact ...
Giesbrecht, Mark, Haraldson, Joseph
core +1 more source
Approximate Bayesian Computation [PDF]
Annual Review of Statistics and Its Application, 2019 Many of the statistical models that could provide an accurate, interesting, and testable explanation for the structure of a data set turn out to have intractable likelihood functions. The method of approximate Bayesian computation (ABC) has become a popular approach for tackling such models.
Osvaldo A. Martin +2 more
openaire +3 more sources
Metrics, Noise Propagation Models, and Design Framework for Floating-Point Approximate Computing
IEEE Access, 2021 Approximate computing has emerged as an efficient solution for energy saving at the expense of calculation accuracy, especially for floating-point operation intensive applications, which have urgent demands for some uniform design frameworks for floating-
Yiyao Xiang +4 more
doaj +1 more source
Approximate Bayesian computational methods [PDF]
Statistics and Computing, 2011 7 ...
Marin, Jean-Michel +3 more
openaire +4 more sources
AxCEM: Designing Approximate Comparator-Enabled Multipliers
Journal of Low Power Electronics and Applications, 2020 Floating-point multipliers have been the key component of nearly all forms of modern computing systems. Most data-intensive applications, such as deep neural networks (DNNs), expend the majority of their resources and energy budget for floating-point ...
Samar Ghabraei +3 more
doaj +1 more source
Approximate Counting and Quantum Computation [PDF]
Combinatorics, Probability and Computing, 2005 Motivated by the result that an `approximate' evaluation of the Jones polynomial of a braid at a $5^{th}$ root of unity can be used to simulate the quantum part of any algorithm in the quantum complexity class BQP, and results relating BQP to the counting class GapP, we introduce a form of additive approximation which can be used to simulate a function
Bordewich, M. +3 more
openaire +3 more sources
Distributed Methods for Computing Approximate Equilibria [PDF]
, 2015 We present a new, distributed method to compute approximate Nash equilibria in bimatrix games. In contrast to previous approaches that analyze the two payoff matrices at the same time (for example, by solving a single LP that combines the two players ...
Czumaj, Artur +5 more
core +2 more sources
SquASH: Approximate Square-Accumulate With Self-Healing
IEEE Access, 2018 Approximate computing strives to achieve the highest performance-, area-, and power-efficiency for a given quality constraint and vice versa. Conventional approximate design methodology restricts the introduction of errors to avoid a high loss in quality.
G. A. Gillani +5 more
doaj +1 more source
TAFFO: The compiler-based precision tuner
SoftwareX, 2022 We present taffo, a framework that automatically performs precision tuning to exploit the performance/accuracy trade-off. In order to avoid expensive dynamic analyses, taffo leverages programmer annotations which encapsulate domain knowledge about the ...
Daniele Cattaneo +3 more
doaj +1 more source