Concept

Quantum complexity theory

Publications associées (357)

Undeniable Signatures Based on Characters: How to Sign with One Bit

We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. Its asymptotic complexity is attractive: the asymptotic complexity of all algo ...

2004

Learning structured dictionaries for image representation

Pierre Vandergheynst, Gianluca Monaci

The dictionary approach to signal and image processing has been massively investigated in the last two decades, proving very attractive for a wide range of applications. The effectiveness of dictionary-based methods, however, is strongly influenced by the ...

IEEE2004

Learning Structured Dictionaries for Image Representation

Pierre Vandergheynst, Gianluca Monaci

2004

Moving object detection between multiple and color images

Touradj Ebrahimi, Emrullah Durucan

There are several publications dedicated to the description and analysis of change detection between two gray-value images. This paper introduces new methods to detect moving objects between multiple images and to detect changes between color images or any ...

2003

Sampling With Finite Rate of Innovation: Channel and Timing Estimation for UWB and GPS

Martin Vetterli, Irena Maravic

Abstract—In this work, we consider the problem of channel estimation by using the recently developed theory for sampling of signals with a finite rate of innovation [1]. We show a framework which allows for lower than Nyquist rate sampling applicable ...

2003

Probabilistic Queries in Large-Scale Networks

Fernando Pedone

Resource location is a fundamental problem for large-scale distributed applications. This paper discusses the problem from a probabilistic perspective. Contrary to deterministic approaches, which strive to produce a precise outcome, probabilistic approache ...

2002

A Regularized Robust Design Criterion for Uncertain Data

Ali H. Sayed

This paper formulates and solves a robust criterion for least-squares designs in the presence of uncertain data. Compared with earlier studies, the proposed criterion incorporates simultaneously both regularization and weighting and applies to a large clas ...

Society for Industrial and Applied Mathematics2002

Unknown-Multiple Speaker clustering using HMM

Hervé Bourlard, Jitendra Ajmera

An HMM-based speaker clustering framework is presented, where the number of speakers and segmentation boundaries are unknown \emph{a priori}. Ideally, the system aims to create one pure cluster for each speaker. The HMM is ergodic in nature with a minimum ...

2002

Unknown-Multiple Speaker clustering using HMM

Hervé Bourlard, Jitendra Ajmera

IDIAP2002

Discretization of the radon transform and of its inverse by spline convolutions

Michaël Unser, Michael Stefan Daniel Liebling, Stefan Horbelt

We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths hi and degrees ni. We apply our results to derive spline-convolution-based algorithms for two closely related prob ...

IEEE2002

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