Publications related to Efficient multiplication using type $2$ optimal normal bases

Multichannel Sampling with Unknown Gains and Offsets: A Fast Reconstruction Algorithm

We study a multichannel sampling scheme, where different channels observe scaled and shifted versions of a common bandlimited signal. The channel gains and offsets are unknown a priori, and each channel samples at sub-Nyquist rates. This setup appears in m ...

2010

A Fast Parallel Matrix Multiplication Reconfigurable Unit Utilized In Face Recognitions Systems

In this paper we present a reconfigurable device which significantly improves the execution time of the most computational intensive functions of three of the most widely used face recognition algorithms; those tasks multiply very large dense matrices. The ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Formalisms for Specifying Markovian Population Models

Barbara Jobstmann, Verena Wolf

We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages -matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Faster Integer Multiplication

For more than 35 years, the fastest known method for integer multiplication has been the Schonhage-Strassen algorithm running in time O(n log n log log n). Under certain restrictive conditions, there is a corresponding Omega(n log n) lower bound. All this ...

2009

Evaluation of pH indicator-based colorimetric films for ammonia detection using optical waveguides

Nico de Rooij, Danick Briand, Jérôme Courbat

The evaluation of colorimetric films for the detection of low concentrations of gaseous ammonia in a waveguide configuration is presented. They were composed of a pH indicator selective to NH3 embedded in a polymeric matrix and deposited on an optical wave ...

2009

Architectural improvements for field programmable counter arrays: enabling efficient synthesis of fast compressor trees on FPGAs

Paolo Ienne, Yusuf Leblebici, Philip Brisk, Alessandro Cevrero, Ajay Kumar Verma, Hadi Parandeh Afshar, Panagiotis Athanasopoulos

The Field Programmable Counter Array (FPCA) was introduced to improve FPGA performance for arithmetic circuits. An FPCA is a reconfigurable IP core that can be integrated into an FPGA. To exploit the FPCA, a circuit is transformed by merging disparate addi ...

ACM2008

Dictionary Identifiability from Few Training Samples

Rémi Gribonval, Karin Schnass

This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via

ell^1

minimisation, or more precisely the problem of identifying a dictionary

dico

from a set of training samples

Y

knowing that $ ...

2008

Recognition of generalized network matrices

Antoine Musitelli

In this thesis, we deal with binet matrices, an extension of network matrices. The main result of this thesis is the following. A rational matrix A of size n×m can be tested for being binet in time O(n6m). If A is binet, our algorithm outputs a nonsingular ...

EPFL2007

On the stability of Reduced Basis methods for Stokes Equations in parametrized domains

Gianluigi Rozza

We present an application of reduced basis method for Stokes equations in domains with affine parametric dependence. The essential components of the method are (i) the rapid convergence of global reduced basis approximations – Galerkin projection onto a sp ...

2007

On Matrix Rigidity and the Complexity of Linear Forms

Mahdi Cheraghchi Bashi Astaneh

The rigidity function of a matrix is defined as the minimum number of its entries that need to be changed in order to reduce the rank of the matrix to below a given parameter. Proving a strong enough lower bound on the rigidity of a matrix implies a nontri ...

2005

Efficient multiplication using type $2$ optimal normal bases

Graph Chatbot

Chat with Graph Search

Multichannel Sampling with Unknown Gains and Offsets: A Fast Reconstruction Algorithm

A Fast Parallel Matrix Multiplication Reconfigurable Unit Utilized In Face Recognitions Systems

Formalisms for Specifying Markovian Population Models

Faster Integer Multiplication

Evaluation of pH indicator-based colorimetric films for ammonia detection using optical waveguides

Architectural improvements for field programmable counter arrays: enabling efficient synthesis of fast compressor trees on FPGAs

Dictionary Identifiability from Few Training Samples

Recognition of generalized network matrices

On the stability of Reduced Basis methods for Stokes Equations in parametrized domains

On Matrix Rigidity and the Complexity of Linear Forms

Faster Integer Multiplication

Evaluation of pH indicator-based colorimetric films for ammonia detection using optical waveguides

On Matrix Rigidity and the Complexity of Linear Forms

Dictionary Identifiability from Few Training Samples

On the stability of Reduced Basis methods for Stokes Equations in parametrized domains

A Fast Parallel Matrix Multiplication Reconfigurable Unit Utilized In Face Recognitions Systems

Multichannel Sampling with Unknown Gains and Offsets: A Fast Reconstruction Algorithm

Recognition of generalized network matrices

Formalisms for Specifying Markovian Population Models

Architectural improvements for field programmable counter arrays: enabling efficient synthesis of fast compressor trees on FPGAs