Concept

Méthode de Ruffini-Horner

Publications associées (18)

Euclidean Distance Matrix Completion for Ad-hoc Microphone Array Calibration

Hervé Bourlard, Philip Neil Garner, Mohammadjavad Taghizadeh, Reza Parhizkar

This paper addresses the application of missing data recovery via matrix completion for audio sensor networks. We propose a method based on Euclidean distance matrix completion for ad-hoc microphone array location calibration. This method can calibrate a f ...

2013

Euclidean Distance Matrix Completion for Ad-hoc Microphone Array Calibration

Hervé Bourlard, Philip Neil Garner, Mohammadjavad Taghizadeh, Reza Parhizkar

2013

Data Exchange Problem with Helpers

Michael Christoph Gastpar, Sameer Pawar

In this paper we construct a deterministic polyno- mial time algorithm for the problem where a set of users is interested in gaining access to a common file, but where each has only partial knowledge of the file. We further assume the existence of another ...

2012

Efficient machine precision computation of impedance matrix elements in surface integral equation formulations

Juan Ramon Mosig

The direct evaluation program tailored to the singular integrals arising in the first-kind and second-kind Fredholm surface integral equation formulations is presented. The exponential convergence of the proposed technique can safely guarantee the inherite ...

2011

Fast and accurate computation of hyper-singular integrals in Galerkin surface integral equation formulations via the direct evaluation method

Juan Ramon Mosig

Hypersingular 4-D integrals, arising in the Galerkin discretization of surface integral equation formulations, are computed by means of the direct evaluation method. The proposed scheme extends the basic idea of the singularity cancellation methods, usuall ...

Institute of Electrical and Electronics Engineers2011

Efficient volume rendering on the body centered cubic lattice using box splines

Dimitri Nestor Alice Van De Ville

We demonstrate that non-separable box splines deployed on body centered cubic lattices (BCC) are suitable for fast evaluation on present graphics hardware. Therefore, we develop the linear and quintic box splines using a piecewise polynomial (pp)-form as o ...

2010

Chinese remaindering based cryptosystems in the presence of faults

Arjen Lenstra

We present some observations on public key cryptosystems that use the Chinese remaindering algorithm. Our results imply that careless implementations of such systems could be vulnerable. Only one faulty signature, in some explained context, is enough to re ...

Springer Verlag1999

Deciding properties of number fields without factoring

Mohammad Amin Shokrollahi

The polynomial time algorithm of Lenstra, Lenstra, and Lovász [15] for factoring integer polynomials and variants thereof have been widely used to show that various computational problems in number theory have polynomial time solutions. Among them is the p ...

1997

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search