Results 31 to 40 of about 102,917 (301)
AxCEM: Designing Approximate Comparator-Enabled Multipliers
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
SquASH: Approximate Square-Accumulate With Self-Healing
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
Hierarchical Approximate Bayesian Computation [PDF]
Approximate Bayesian computation (ABC) is a powerful technique for estimating the posterior distribution of a model’s parameters. It is especially important when the model to be fit has no explicit likelihood function, which happens for computational (or simulation-based) models such as those that are popular in cognitive neuroscience and other areas ...
Turner, Brandon M., Van Zandt, Trisha
openaire +3 more sources
IncApprox: A Data Analytics System for Incremental Approximate Computing [PDF]
Incremental and approximate computations are increasingly being adopted for data analytics to achieve low-latency execution and efficient utilization of computing resources. Incremental computation updates the output incrementally instead of re-computing
Krishnan, Dhanya R. +9 more
core +1 more source
TAFFO: The compiler-based precision tuner
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
Approximate Counting and Quantum Computation [PDF]
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
A comparative review of dimension reduction methods in approximate Bayesian computation [PDF]
Approximate Bayesian computation (ABC) methods make use of comparisons between simulated and observed summary statistics to overcome the problem of computationally intractable likelihood functions.
Prangle, D. +6 more
core +1 more source
Low Power Neural Network by Reducing SRAM Operating Voltage
With advancements in machine learning technology, networks are becoming increasingly complex, and the extent of the computation involved is increasing. Consequently, the computation time and power consumption of the learning process are increased.
Keisuke Kozu +3 more
doaj +1 more source
Circuit Aware Approximate System Design With Case Studies in Image Processing and Neural Networks
This paper aims to exploit approximate computing units in image processing systems and artificial neural networks. For this purpose, a general design methodology is introduced, and approximation-oriented architectures are developed for different ...
Tuba Ayhan, Mustafa Altun
doaj +1 more source
Theory and experimental verification of configurable computing with stochastic memristors
The inevitable variability within electronic devices causes strict constraints on operation, reliability and scalability of the circuit design. However, when a compromise arises among the different performance metrics, area, time and energy, variability ...
Rawan Naous +9 more
doaj +1 more source

