Concept

Algorithme de Grover

Publications associées (92)

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

Sequence Classification with Input-Output Hidden Markov Models

Samy Bengio, Silvia Chiappa

We present a training and testing method for Input-Output Hidden Markov Model that is particularly suited for classification of sequences in which class information accumulates over time. We discuss two such cases: the discrimination of mental tasks from s ...

IDIAP2004

Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems

Boi Faltings, Carlos Eisenberg

Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unsolvability and is thus not suitable for highly constrained or overconstrained ...

Swiss Federal Institute of Technology (EPFL)2003

Modeling Consensus in a Process Calculus

Rachele Fuzzati, Massimo Merro

We give a process calculus model that formalizes a well-known algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failure detectors; we use our model to formally prove that the algorithm satisfies its spec ...

2003

Modeling Consensus in a Process Calculus

Rachele Fuzzati, Massimo Merro

We give a process calculus model that formalizes a well known algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failure detectors (Diamond S); we use our model to formally prove that the algorithm satisf ...

2003

One-dimensional biexcitons in a single quantum wire

Benoît Marie Joseph Deveaud, Andrea Crottini, Xiao Wang

We report the direct observation of one-dimensional (ID) excitonic molecules (biexcitons) in high quality disorder free semiconductor quantum wires. By means of spatially resolved near-field photoluminescence spectroscopy, we detected delocalized 1D excito ...

2002

Optical speedup at transparency of the gain recovery in semiconductor optical amplifiers

Benoît Marie Joseph Deveaud, Marc-André Dupertuis

Experimental demonstration of optical speedup at transparency (OSAT) has been performed on a 1 mm long semiconductor optical amplifiers (SOA). OSAT is a recently proposed scheme that decreases the recovery time of an SOA while maintaining the available gai ...

2002

Computation of the discrete logarithm on elliptic curves of trace one

Jean Monnerat

The security of several elliptic curve cryptosystems is based on the difficulty to compute the discrete logarithm problem. The motivation of using elliptic curves in cryptography is that there is no known sub-exponential algorithm which solves the Elliptic ...

2002

Multidimensional Elastic Registration of Images Using Splines

Michaël Unser

We present an algorithm for nonlinear multidimensional registration. The correspondence function is represented in a spline space, as well as the volumes being registered. We also use the cubic splines to interpolate the volumetric data to be registered. W ...

IEEE2000

Compensation of Unidirectional Geometric Distortion in EPI Using Spline Warping

Michaël Unser, Philippe Thévenaz

Due to magnetic field inhomogeneities, EPI images are geometrically distorted, predominantly along the phase-encoding direction. Currently, the distortion is either ignored or compensated manually using a warping function defined through a set of landmarks ...

IEEE1999

OpenMP on Networks of SMPs

Willy Zwaenepoel

In this paper, we present the first system that implements OpenMP on a network of shared-memory multiprocessors. This system enables the programmer to rely on a single, standard, shared-memory API for parallelization within a multiprocessor and between mul ...

1999