Concept

Alphabet

Related publications (18)

Polarity-Balanced Codes

Balanced bipolar codes consist of sequences in which the symbols ‘−1’ and ‘+1’ appear equally often. Several generalizations to larger alphabets have been considered in literature. For example, for the q-ary alphabet {−q+1,−q+3, . . . , q−1}, known concept ...

2013

Algorithm for a Microfluidic Assembly Line

Tobias Schneider

Microfluidic technology has revolutionized the control of flows at small scales giving rise to new possibilities for assembling complex structures on the microscale. We analyze different possible algorithms for assembling arbitrary structures, and demonstr ...

American Physical Society2011

A Kernel Wrapper for Phoneme Sequence Recognition

We describe a kernel wrapper, a Mercer kernel for the task of phoneme sequence recognition which is based on operations with the Gaussian kernel, and suitable for any sequence kernel classifier. We start by presenting a kernel-based algorithm for phoneme s ...

John Wiley and Sons2009

A mealy machine with polynomial growth of irrational degree

We consider a very simple Mealy machine ( two nontrivial states over a two-symbol alphabet), and derive some properties of the semigroup it generates. It is an infinite, finitely generated semigroup, and we show that the growth function of its balls behave ...

2008

Discriminative Kernel-Based Phoneme Sequence Recognition

Samy Bengio

We describe a new method for phoneme sequence recognition given a speech utterance, which is not based on the HMM. In contrast to HMM-based approaches, our method uses a discriminative kernel-based training procedure in which the learning process is tailor ...

2006

Discriminative Kernel-Based Phoneme Sequence Recognition

Samy Bengio

We describe a new method for phoneme sequence recognition given a speech utterance. In contrast to HMM-based approaches, our method uses a kernel-based discriminative training procedure in which the learning process is tailored to the goal of minimizing th ...

IDIAP2006

Mismatched decoding revisited: general alphabets, channels with memory, and the wide-band limit

Emre Telatar

The mismatch capacity of a channel is the highest rate at which reliable communication is possible over the channel with a given (possibly suboptimal) decoding rule. This quantity has been studied extensively for single-letter decoding rules over discrete ...

2000

Implementation of 8-bit Coded Character Sets in Ada

A general frame is proposed for implementing 8-bit coded character sets in Ada in conformance with current international standards. This frame is then applied to what is termed Latin alphabet No. 1 which covers Western European languages. Also shown is how ...

1990

Graph Chatbot

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.