Publications related to Computation Complexity Reduction Technique for Accurate Seizure Detection Implants

Multistream speaker diarization of meetings recordings beyond MFCC and TDOA features

Hervé Bourlard, Fabio Valente, Deepu Vijayasenan

Many state-of-the-art diarization systems for meeting recordings are based on the HMM/GMM framework and the combination of spectral (MFCC) and time delay of arrivals (TDOA) features. This paper presents an extensive study on how multistream diarization can ...

2012

Strongly feasible stochastic model predictive control

Milan Korda

In this article we develop a systematic approach to enforce strong feasibility of probabilistically constrained stochastic model predictive control problems for linear discrete-time systems under affine disturbance feedback policies. Two approaches are pre ...

2011

Recipes on Hard Thresholding Methods

Volkan Cevher, Anastasios Kyrillidis

Compressive sensing (CS) is a data acquisition and recovery technique for finding sparse solutions to linear inverse problems from sub-Nyquist measurements. CS features a wide range of computationally efficient and robust signal recovery methods, based on ...

2011

Fast Speaker Verification on Mobile Phone data using Boosted Slice Classifiers

Sébastien Marcel, Anindya Roy

In this work, we investigate a novel computationally efficient speaker verification (SV) system involving boosted ensembles of simple threshold-based classifiers. The system is based on a novel set of features called “slice features”. Both the system and t ...

2011

FASTER CADZOW DENOISING BASED ON PARTIAL EIGENVALUE DECOMPOSITION

Yann Barbotin

Certain aspects of the present disclosure relate to a method for speeding up the Cadzow iterative denoising algorithm as a part of the Finite Rate of Innovation (FRI) processing and for decreasing its computational complexity. ...

USPTO2010

Additive Combinatorics and Discrete Logarithm Based Range Protocols

Rafik Chaabouni, Helger Lipmaa

We show how to express an arbitrary integer interval

I = [0, H]

as a sumset

I = \sum_{i=1}^\ell G_i * [0, u - 1] + [0, H']

of smaller integer intervals for some small values

\ell

,

u

, and

H' < u - 1

, where

b * A = \{b a : a \in A\}

and $A + B = ...

Springer2010

Implementation of a 2 x 2 MIMO-OFDM receiver on an application specific processor

Andreas Peter Burg

This paper describes the implementation of the hard computational kernels required for the baseband (BB) processing of a 2 x 2 multiple-input multiple-output (MIMO)-OFDM receiver on a design-framework for application specific processors. The employed low-c ...

2009

Implementation of a 2x2 MIMO-OFDM receiver on an application specific processor

Andreas Peter Burg

This paper describes the implementation of the hard computational kernels required for the baseband (BB) processing of a 2×2 multiple-input multiple-output (MIMO)-OFDM receiver on a design-framework for application specific processors. The employed low-com ...

Elsevier2009

Integration of TDOA Features in Information Bottleneck Framework for Fast Speaker Diarization

Hervé Bourlard, Fabio Valente, Deepu Vijayasenan

In this paper we address the combination of multiple feature streams in a fast speaker diarization system for meeting recordings. Whenever Multiple Distant Microphones (MDM) are used, it is possible to estimate the Time Delay of Arrival (TDOA) for differen ...

IDIAP2008

A profiling framework for high level design space exploration for memory and system architectures

In 1971, the first microprocessor produced in mass production had 2300 transistor and was able to compute 60'000 operations per second at 740 kHz. Nowadays, even a common gaming console uses a central unit including 243 millions of transistors running at 4 ...

EPFL2007

Computation Complexity Reduction Technique for Accurate Seizure Detection Implants

Graph Chatbot

Chat with Graph Search

Multistream speaker diarization of meetings recordings beyond MFCC and TDOA features

Strongly feasible stochastic model predictive control

Recipes on Hard Thresholding Methods

Fast Speaker Verification on Mobile Phone data using Boosted Slice Classifiers

FASTER CADZOW DENOISING BASED ON PARTIAL EIGENVALUE DECOMPOSITION

Additive Combinatorics and Discrete Logarithm Based Range Protocols

Implementation of a 2 x 2 MIMO-OFDM receiver on an application specific processor

Implementation of a 2x2 MIMO-OFDM receiver on an application specific processor

Integration of TDOA Features in Information Bottleneck Framework for Fast Speaker Diarization

A profiling framework for high level design space exploration for memory and system architectures

Multistream speaker diarization of meetings recordings beyond MFCC and TDOA features

Recipes on Hard Thresholding Methods

Implementation of a 2x2 MIMO-OFDM receiver on an application specific processor

Integration of TDOA Features in Information Bottleneck Framework for Fast Speaker Diarization

Strongly feasible stochastic model predictive control

Implementation of a 2 x 2 MIMO-OFDM receiver on an application specific processor

Fast Speaker Verification on Mobile Phone data using Boosted Slice Classifiers

A profiling framework for high level design space exploration for memory and system architectures

FASTER CADZOW DENOISING BASED ON PARTIAL EIGENVALUE DECOMPOSITION

Additive Combinatorics and Discrete Logarithm Based Range Protocols