Search Results - Mathematics of computing Mathematical analysis Functional analysis

PTAS for Sparse General-Valued CSPs by Mezei, Balazs F., Wrochna, Marcin, Zivny, Stanislav

“…We study polynomial-time approximation schemes (PTASes) for constraint satisfaction problems (CSPs) such as Maximum Independent Set or Minimum Vertex Cover on…”
Get full text

Bitwidth-Optimized Energy-Efficient FFT Design via Scaling Information Propagation by Liu, Xinzhe, Chen, Fupeng, Muhamad, Raees Kizhakkumkara, Blinder, David, Nikolova, Dessislava, Schelkens, Peter, Catthoor, Francky, Ha, Yajun

“…The Fast Fourier Transform (FFT) is an efficient algorithm widely used in digital signal processing to transform between the time domain and the frequency…”
Get full text

Invocation-driven Neural Approximate Computing with a Multiclass-Classifier and Multiple Approximators by Song, Haiyue, Xu, Chengwen, Xu, Qiang, Song, Zhuoran, Jing, Naifeng, Liang, Xiaoyao, Jiang, Li

“…Neural approximate computing gains enormous energy-efficiency at the cost of tolerable quality-loss…”
Get full text

ApproxANN: An approximate computing framework for artificial neural network by Qian Zhang, Ting Wang, Ye Tian, Feng Yuan, Qiang Xu

“…). As many of these applications are inherently error-tolerant, in this work, we propose a novel approximate computing framework for ANN, namely ApproxANN…”
Get full text

Joint precision optimization and high level synthesis for approximate computing by Chaofan Li, Wei Luo, Sapatnekar, Sachin S., Jiang Hu

“…Approximate computing has been recognized as an effective low power technique for applications with intrinsic error tolerance, such as image processing and machine learning…”
Get full text

Approximate Floating-Point FFT Design with Wide Precision-Range and High Energy Efficiency by Wen, Chenyi, Wu, Ying, Yin, Xunzhao, Zhuo, Cheng

“…Fast Fourier Transform (FFT) is a key digital signal processing algorithm that is widely deployed in mobile and portable devices. Recently, with the popularity…”
Get full text

Low power GPGPU computation with imprecise hardware by Hang Zhang, Putic, Mateja, Lach, John

“…Massively parallel computation in GPUs significantly boosts performance of compute-intensive applications but creates power and thermal issues that limit…”
Get full text

A Comparison on Constrain Encoding Methods for Quantum Approximate Optimization Algorithm by Liu, Yiwen, Jiao, Qingyue, Shi, Yiyu, Wan, Ke, Guo, Shangjie

“…The Quantum Approximate Optimization Algorithm (QAOA) represents a significant opportunity for practical quantum computing applications, particularly in the era before error correction is fully realized…”
Get full text

An approximate computing technique for reducing the complexity of a direct-solver for sparse linear systems in real-time video processing by Schaffner, Michael, Gurkaynak, Frank K., Smolic, Aljosa, Kaeslin, Hubert, Benini, Luca

“… %, resulting in significant savings in computing time, area or energy…”
Get full text

An approximate voting scheme for reliable computing by Ke Chen, Lombardi, Fabrizio, Jie Han

“…This paper relies on the principles of inexact computing to alleviate the issues arising in static masking by voting for reliable computing…”
Get full text

A high performance split-radix FFT with constant geometry architecture by Kwong, Joyce, Goel, Manish

“…High performance hardware FFTs have numerous applications in instrumentation and communication systems. This paper describes a new parallel FFT architecture…”
Get full text

An Approximation Algorithm for Energy-Efficient Scheduling on A Chip Multiprocessor by Yang, Chuan-Yue, Chen, Jian-Jia, Kuo, Tei-Wei

“…In the recent decade, voltage scaling has become an attractive feature for many system component designs. In this paper, we consider energy-efficient real-time…”
Get full text

Mathematical analysis for interacting multi functional extreme learning machines: Mathematical analysis for interacting multi functional by Cho, Ilwoo, Jorgensen, Palle E. T.

“…In this paper, we analyze interacting multi functional extreme learning machines by applying graph theory, groupoid theory, representation theory, operator…”
Get full text

A flexible and fast software implementation of the FFT on the BPE platform by Cupaiuolo, Teo, Iacono, Daniele Lo

“…The importance of having an efficient Fast Fourier Transform (FFT) implementation is universally recognized as one of the key enablers for the development of…”
Get full text

Fast approximation for peak power driven voltage partitioning in almost linear time by Wang, Jia, Chen, Xiaodao, Liu, Lin, Hu, Shiyan

“…Voltage partitioning on functional units/blocks targeting peak power minimization has been demonstrated to be effective for energy reduction considering voltage island shutdown impact…”
Get full text

Auto-tuning 3-D FFT library for CUDA GPUs by Nukada, Akira, Matsuoka, Satoshi

“…Existing implementations of FFTs on GPUs are optimized for specific transform sizes like powers of two, and exhibit unstable and peaky performance i.e., do not…”
Get full text

Approximation and decomposition of binary decision diagrams by Ravi, Kavita, McMillan, Kenneth L., Shiple, Thomas R., Somenzi, Fabio

“… Recent advances in reachability analysis and model checking algorithms have emphasized the need for efficient algorithms for the approximation and decomposition of BDDs…”
Get full text

A TBR-based trajectory piecewise-linear algorithm for generating accurate low-order models for nonlinear analog circuits and MEMS by Vasilyev, Dmitry, Rewienski, Michal, White, Jacob

“…In this paper we propose a method for generating reduced models for a class of nonlinear dynamical systems, based on truncated balanced realization (TBR)…”
Get full text

Distributed sparse random projections for refinable approximation by Wang, Wei, Garofalakis, Minos, Ramchandran, Kannan

“…Consider a large-scale wireless sensor network measuring compressible data, where n distributed data values can be well-approximated using only k « n…”
Get full text

Model order reduction for strictly passive and causal distributed systems by Daniel, Luca, Phillips, Joel

“… analysis codes that use iterative solution methods and fast-multipole acceleration techniques…”
Get full text