Concept

Histoire de l'alphabet grec

Publications associées (10)

Optima Age Over Erasure Channels

Previous works on age of information and erasure channels have dealt with specific models and computed the average age or average peak age for certain settings. In this paper, given a source that produces a letter every T-s seconds and an erasure channel t ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

The transferability of handwriting skills: from the Cyrillic to the Latin alphabet

Pierre Dillenbourg, Thibault Lucien Christian Asselborn, Wafa Monia Benkaouar Johal

Do handwriting skills transfer when a child writes in two different scripts, such as the Latin and Cyrillic alphabets? Are our measures of handwriting skills intrinsically bound to one alphabet or will a child who faces handwriting difficulties in one scri ...

2021

On the use of direct-coupling analysis with a reduced alphabet of amino acids combined with super-secondary structure motifs for protein fold prediction

Jaume Bonet Martinez

Direct-coupling analysis (DCA) for studying the coevolution of residues in proteins has been widely used to predict the three-dimensional structure of a protein from its sequence. We present RADI/raDIMod, a variation of the original DCA algorithm that grou ...

OXFORD UNIV PRESS2021

Learning (Good Handwriting In Greek) By Teaching (A Humanoid Robot)

Thibault Lucien Christian Asselborn, Wafa Monia Benkaouar Johal, Thanasis Hadzilacos

We report on a follow-up study of the Co-Writer project at EPFL [1]; we confirm their findings, extend the applicability to another language with a different alphabet (Greek) and go into an in-depth qualitative study of the child-robot relationship. The co ...

IATED-INT ASSOC TECHNOLOGY EDUCATION & DEVELOPMENT2020

A Comparison of Social Robot to Tablet and Teacher in a New Script Learning Context

Pierre Dillenbourg, Thibault Lucien Christian Asselborn, Wafa Monia Benkaouar Johal

This research occurred in a special context where Kazakhstan's recent decision to switch from Cyrillic to the Latin-based alphabet has resulted in challenges connected to teaching literacy, addressing a rare combination of research hypotheses and technical ...

FRONTIERS MEDIA SA2020

Robust Generalization via $\alpha$-Mutual Information

Michael Christoph Gastpar, Amedeo Roberto Esposito, Ibrahim Issa

The aim of this work is to provide bounds connecting two probability measures of the same event using Rényi

\alpha

-Divergences and Sibson’s

\alpha

-Mutual Information, a generalization of respectively the Kullback-Leibler Divergence and Shannon’s Mutual ...

ETHZ2020

Optimal Age over Erasure Channels

Emre Telatar, Elie Najm, Rajai Nasser

Given a source that produces a letter every T-s seconds and an erasure channel that can be used every T-c seconds, we ask what is the coding strategy that minimizes the time-average "age of information" that an observer of the channel output incurs. We wil ...

IEEE2019

Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets

Rüdiger Urbanke, Henry Pfister

For any prime power q, Mori and Tanaka introduced a family of q-ary polar codes based on the q x q Reed-Solomon polarization kernels. For transmission over a q-ary erasure channel, they also derived a closed-form recursion for the erasure probability of ea ...

2019

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

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

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