Concept

Time-sharing system evolution

Publications associées (12)

TimeEvolver: A program for time evolution with improved error bound

We present TimeEvolver, a program for computing time evolution in a generic quantum system. It relies on well-known Krylov subspace techniques to tackle the problem of multiplying the exponential of a large sparse matrix iH, where His the Hamiltonian, with ...

ELSEVIER2022

Simultaneous Reciprocal and Real Space X-Ray Imaging of Time-Evolving Systems

Goran Lovric, Marco Stampanoni

Imaging the (sub)micron scale over large areas with high temporal resolution becomes increasingly necessary for the development and investigation of novel materials under realistic operation conditions. Small angle x-ray scattering imaging methods provide ...

AMER PHYSICAL SOC2021

Gaussian Multiple Access via Compute-and-Forward

Michael Christoph Gastpar, Jingge Zhu

Lattice codes used under the compute-and-forward paradigm suggest an alternative strategy for the standard Gaussian multiple-access channel (MAC): the receiver succes- sively decodes the integer linear combinations of the messages until it can invert and r ...

Institute of Electrical and Electronics Engineers2017

Integrating Posterior Features and Self-Organizing Maps for Isolated Word Recognition without Dynamic Programming

Serena Soldo

In recent works, the use of phone class-conditional posterior probabilities (posterior features) directly as features provided successful results in template-based ASR systems. Moreover, it has been shown that these features tend to be sparse and orthogona ...

Idiap2012

Template-based ASR using Posterior features and synthetic references: comparing different TTS systems

Hervé Bourlard, Serena Soldo

In recent works, the use of phone class-conditional posterior probabilities (posterior features) directly as features provided successful results in template-based ASR systems. In this paper, motivated by the high quality of current text-to-speech systems ...

2012

Cooperative Secret Communication with Artificial Noise in Symmetric Interference Channel

Jingge Zhu

We consider the symmetric Gaussian interference channel where two users try to enhance their secrecy rates in a cooperative manner. Artificial noise is introduced along with useful information. We derive the power control and artificial noise parameter for ...

2010

Real-Time ASR from Meetings

Philip Neil Garner, John David Scott Dines, Danil Korchagin, Le Zhang

The AMI(DA) system is a meeting room speech recognition system that has been developed and evaluated in the context of the NIST Rich Text (RT) evaluations. Recently, the ``Distant Access'' requirements of the AMIDA project have necessitated that the system ...

2009

Real-Time ASR from Meetings

Philip Neil Garner, John David Scott Dines, Danil Korchagin, Le Zhang

The AMI(DA) system is a meeting room speech recognition system that has been developed and evaluated in the context of the NIST Rich Text (RT) evaluations. Recently, the "Distant Access" requirements of the AMIDA project have necessitated that the system o ...

Idiap2009

On Wide Band Broadcast Channels

Rüdiger Urbanke, Emre Telatar, Amos Lapidoth

We study the capacity regions of various broadband degraded broadcast channels including the degraded Poisson broadcast channel and the degraded very-noisy broadcast channel. It is shown that in the absence of dark current the capacity region of the degrad ...

2003

Achieving General Points in the 2-User Gaussian MAC Without Time-Sharing or Rate-Splitting by Means of Iterative Coding

Rüdiger Urbanke, Sanket Dusad, Abdelaziz Amraoui

We analyze iterative coding for the frame-synchronous binary-input discrete-time Gaussian multiple access channel. Using the method of Density Evolution, we optimize degree distributions to exhibit code ensembles whose iterative decoding thresholds are onl ...

2002

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