Publications related to Greek alphabet

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

Optical Character Recognition of 19th Century Classical Commentaries: the Current State of Affairs

Matteo Romanello, Sven-Nicolas Yoann Najem

Together with critical editions and translations, commentaries are one of the main genres of publication in literary and textual scholarship, and have a century-long tradition. Yet, the exploitation of thousands of digitized historical commentaries was hit ...

ACM Digital Library2021

Optical Character Recognition of 19th Century Classical Commentaries: the Current State of Affairs

Matteo Romanello, Sven-Nicolas Yoann Najem

Together with critical editions and translations, commentaries are one of the main genres of publication in literary and textual scholarship, and have a century-long tradition. Yet, the exploitation of thousands of digitized historical commentaries was hit ...

2021

Il demone dell'analogia: Ovvero affinità e divergenze fra il compagno aristotele e noi

Nicola Braghieri

This laconic discourse uses the Aristotelian authority to define the role of the analogical procedure in the government of the architectural composition. Respecting its ambiguous balance between mathematical method and attitude of the imagination, analogy ...

2021

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

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

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

Measurement of the time-dependent CP asymmetry in B-0 -> J/psi K-S(0) decays

Olivier Schneider, Aurelio Bay, Yiming Li, Guido Haefeli, Frédéric Blanc, Christoph Frei, Tatsuya Nakada, Julien Rouvinet, Barinjaka Rakotomiaramanana, Raluca Anca Muresan, Michel De Cian, Christophe Salzmann, Johan Luisier, Anne Keune, Jian Wang, Vincent Fave, Yi Zhang, Lei Zhang, Jessica Prisciandaro, Mark Tobin, Minh Tâm Tran, Niko Neufeld, Matthew Needham, Marc-Olivier Bettler, Greig Alan Cowan, Maurizio Martinelli, Donal Patrick Hill, Cédric Potterat, Jean Wicht, Plamen Hristov Hopchev, Bastien Luca Muster, Frédéric Guillaume Dupertuis, Pierre Jaton, Joël Bressieux, Songmei Wu, Hans Dijkstra, Gerhard Raven, Peter Clarke, Frédéric Teubert, Giovanni Carboni, Victor Coco, Wenyu Zhang

Irregular Product Codes

Mohammad Amin Shokrollahi, Ghid Maatouk, Seyed Omid Etesami, Masoud Alipour Babaei

We introduce irregular product codes, a class of codes where each codeword is represented by a matrix and the entries in each row (column) of the matrix come from a component row (column) code. As opposed to standard product codes, we do not require that a ...

Ieee2012

Anti-uniform Huffman codes

In this study, the authors consider the class of anti-uniform Huffman (AUH) codes. The authors derived tight lower and upper bounds on the average codeword length, entropy and redundancy of finite and infinite AUH codes in terms of the alphabet size of the ...

2011

Search for lepton flavor violating τ- decays into ℓ-KS 0 and ℓ-KS 0KS 0

Olivier Schneider, Aurelio Bay, Remi Léandre Albert Louvot, Jian Wang, Chao Wang, Vladislav Balagura, Ji Hyun Kim, Xiao Wang, Jing Li

We have searched for the lepton-flavor-violating decays τ- decays into ℓ-KS 0 and ℓ-KS 0KS 0 (ℓ=e or μ), using a data sample of 671 fb-1 collected with the Belle detector at the KEKB asymmetric-energy e+e- collider. No evidence for a signal was found in an ...

2010

Measurement of cross sections of exclusive e+ e- → V P processes at sqrt(s) = 10.58 GeV

Olivier Schneider, Aurelio Bay, Remi Léandre Albert Louvot, Chao Wang, Vladislav Balagura, Ji Hyun Kim

The cross sections for the reactions e+ e- → φ{symbol} η, φ{symbol} η′, ρη, ρ η′ have been measured using a data sample of 516 fb- 1 collected with the Belle detector at the KEKB asymmetric-energy e+ e- collider. The corresponding values of the cross secti ...

2009

Tight bounds on the AUH codes

Ali Kakhbod

In this paper we consider the class of anti-uniform Huffman codes and derive tight lower and upper hounds on the average length, entropy, and redundancy of such codes in terms of the alphabet size of the source. Also an upper bound on the entropy of AUH co ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

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

Non-binary LDPC codes and EXIT like functions

In the first part of this thesis we are interested in the asymptotic performance analysis of Non-Binary Low-Density Parity-Check (NBLDPC) codes over the Binary Erasure Channel (BEC) decoded via the suboptimal Belief Propagation (BP) decoder as well as the ...

EPFL2008

Search for lepton flavor violating τ- decays with a KS 0 meson

Olivier Schneider, Stewart Cole, Chao Wang, Tagir Aushev, Lei Zhang

We have searched for the lepton flavor violating decays τ- → ℓ- KS 0 (ℓ = e or μ), using a data sample of 281 fb-1 collected with the Belle detector at the KEKB e+ e- asymmetric-energy collider. No evidence for a signal was found in either of the decay mod ...

2006

On Average Throughput Benefits and Alphabet Size in Network Coding

Christina Fragouli, Emina Soljanin

We examine the throughput benefits that network coding offers with respect to the average through- put achievable by routing, where the average throughput refers to the average of the rates that the indi- vidual receivers experience. We relate these benefi ...

2006

On Average Throughput Benefits and Alphabet Size in Network Coding

Christina Fragouli, Emina Soljanin

e analyze a special class of configurations with h sources and N receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to \sq ...

2005