Abstract: Approximate computing is an emerging computing paradigm offering benefits in hardware metrics, such as design area and power consumption, by relaxing the requirement for full accuracy. In ...

Part of Proceedings, Les Houches School of Physics: Frontiers in Number Theory, Physics and Geometry II: On Conformal Field Theories, Discrete Groups and Renormalization: Les Houches, France, March ...

A feature engineering algorithm reducing the number of features while retaining the basis information necessary to reconstruct the original data. A matrix V is factorized into (usually) two matrices W ...

The General Number Field Sieve (GNFS) represents the asymptotically fastest known classical algorithm for integer factorization of large composite numbers, with a sub-exponential complexity of L[1/3, ...

Abstract: It is known that the spectral factorization mapping is unbounded in the Wiener algebra, in general. However in applications, the given data are often polynomials. For such finite dimensional ...

Nakajima and Grojnowski have shown that the cohomology H of Hilb(X) is naturally a representation of the Heisenberg Lie algebra modelled on the cohomology of X, and is isomorphic as a representation ...

ABSTRACT: Hyperspectral unmixing is a powerful tool for the remote sensing image mining. Nonnegative matrix factorization (NMF) has been adopted to deal with this issue, while the precision of ...