Publications related to Word problem (mathematics)

Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

This paper considers the problem of distributed lossy compression where the goal is to recover one or more linear combinations of the sources at the decoder, subject to distortion constraints. For certain configurations, it is known that codes with algebra ...

2023

On Polynomial Algorithms for Normalizing Formulas

Viktor Kuncak, Simon Guilloud, Mario Bucev

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

2022

Secure transmission using an untrusted relay with scaled compute-and-forward

Michael Christoph Gastpar, Jasper Goseling

A two-hop channel is considered, in which the source wants to send information to the destination while keeping the information confidential from the relay. A novel lattice chain and compute-and-forward based scheme is proposed in which the destination pro ...

IEEE2015

English Spoken Term Detection in Multilingual Recordings

Petr Motlicek, Philip Neil Garner, Fabio Valente

This paper investigates the automatic detection of English spoken terms in a multi-language scenario over real lecture recordings. Spoken Term Detection (STD) is based on an LVCSR where the output is represented in the form of word lattices. The lattices a ...

2010

English Spoken Term Detection in Multilingual Recordings

Petr Motlicek, Philip Neil Garner, Fabio Valente

Idiap2010

Comparing Different Word Lattice Rescoring Approaches Towards Keyword Spotting

Hervé Bourlard, Hynek Hermansky, Joel Praveen Pinto

In this paper, we further investigate the large vocabulary continuous speech recognition approach to keyword spotting. Given a speech utterance, recognition is performed to obtain a word lattice. The posterior probability of keyword hypotheses in the latti ...

IDIAP2007

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.