Publications related to On the Complexity of the Class of Regions Computable by a Two-Layered Perceptron

Reduced complexity attacks on the alternating step generator

Willi Meier, Shahram Khazaei, Simon Fischer

In this paper, we present some reduced complexity attacks on the Alternating Step Generator (ASG). The attacks are based on a quite general framework and mostly benefit from the low sampling resistance of the ASG, and of an abnormal behavior related to the ...

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

Bayesian Factorial Linear Gaussian State-Space Models for Biosignal Decomposition

Silvia Chiappa

We discuss a method to extract independent dynamical systems underlying a single or multiple channels of observation. In particular, we search for one dimensional subsignals to aid the interpretability of the decomposition. The method uses an approximate B ...

2007

Accurate Non-Iterative O(n) Solution to the PnP Problem

Pascal Fua, Vincent Lepetit

We propose a non-iterative solution to the PnP problem---the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences---whose computational complexity grows linearly with n. This is in contrast to state-of-the-art method that are ...

2007

Accurate non-iterative O(n) solution to the PnP problem

Pascal Fua, Vincent Lepetit

We propose a non-iterative solution to the PnP problem-the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences-whose computational complexity grows linearly with n. This is in contrast to state-of-the-art methods that are O( ...

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

AGGLOMERATIVE INFORMATION BOTTLENECK FOR SPEAKER DIARIZATION OF MEETINGS DATA

Hervé Bourlard, Fabio Valente, Deepu Vijayasenan

In this paper, we investigate the use of agglomerative Information Bottleneck (aIB) clustering for the speaker diarization task of meetings data. In contrary to the state-of-the-art diarization systems that models individual speakers with Gaussian Mixture ...

2007

AGGLOMERATIVE INFORMATION BOTTLENECK FOR SPEAKER DIARIZATION OF MEETINGS DATA

Hervé Bourlard, Fabio Valente, Deepu Vijayasenan

In this paper, we investigate the use of agglomerative Information Bottleneck (aIB) clustering for the speaker diarization task of meetings data. In contrary to the state-of-the-art diarization systems that models individual speakers with Gaussian Mixture ...

IDIAP2007

Circumventing the problem of the scale: discrete choice models with multiplicative error terms

Michel Bierlaire

We propose a multiplicative specification of a discrete choice model that renders choice probabilities independent of the scale of the utility. The scale can thus be random with unspecified distribution. The model mostly outperforms the classical additive ...

2007

Circumventing the problem of the scale: discrete choice models with multiplicative error terms

Michel Bierlaire

We propose a multiplicative specification of a discrete choice model that renders choice probabilities independent of the scale of the utility. The scale can thus be random with unspecified distribution. The model mostly outperforms the classical additive ...

2007

Computational Hardness and Explicit Constructions of Error Correcting Codes

Mohammad Amin Shokrollahi, Mahdi Cheraghchi Bashi Astaneh

We outline a procedure for using pseudorandom generators to construct binary codes with good properties, assuming the existence of sufficiently hard functions. Specifically, we give a polynomial time algorithm, which for every integers

n

and

k

, constru ...

2006

Reverse Search for Parametric Linear Programming

Colin Neil Jones

This paper introduces a new enumeration technique for (multi)parametric linear programs (pLPs) based on the reverse-search paradigm. We prove that the proposed algorithm has a computational complexity that is linear in the size of the output (number of so- ...

IEEE2006

On the Complexity of the Class of Regions Computable by a Two-Layered Perceptron

Graph Chatbot

Chat with Graph Search

Reduced complexity attacks on the alternating step generator

Bayesian Factorial Linear Gaussian State-Space Models for Biosignal Decomposition

Accurate Non-Iterative O(n) Solution to the PnP Problem

Accurate non-iterative O(n) solution to the PnP problem

AGGLOMERATIVE INFORMATION BOTTLENECK FOR SPEAKER DIARIZATION OF MEETINGS DATA

AGGLOMERATIVE INFORMATION BOTTLENECK FOR SPEAKER DIARIZATION OF MEETINGS DATA

Circumventing the problem of the scale: discrete choice models with multiplicative error terms

Circumventing the problem of the scale: discrete choice models with multiplicative error terms

Computational Hardness and Explicit Constructions of Error Correcting Codes

Reverse Search for Parametric Linear Programming

Accurate non-iterative O(n) solution to the PnP problem

AGGLOMERATIVE INFORMATION BOTTLENECK FOR SPEAKER DIARIZATION OF MEETINGS DATA

Accurate Non-Iterative O(n) Solution to the PnP Problem

Reduced complexity attacks on the alternating step generator

AGGLOMERATIVE INFORMATION BOTTLENECK FOR SPEAKER DIARIZATION OF MEETINGS DATA

Bayesian Factorial Linear Gaussian State-Space Models for Biosignal Decomposition

Circumventing the problem of the scale: discrete choice models with multiplicative error terms

Circumventing the problem of the scale: discrete choice models with multiplicative error terms

Computational Hardness and Explicit Constructions of Error Correcting Codes

Reverse Search for Parametric Linear Programming