Concept

Semilattice

Publications associées (22)

Simple biset functors and double Burnside ring

Let G be a finite group and let k be a field. Our purpose is to investigate the simple modules for the double Burnside ring kB(G,G). It turns out that they are evaluations at G of simple biset functors. For a fixed finite group H, we introduce a suitable b ...

Elsevier2013

Magnonic band structures in two-dimensional bi-component magnonic crystals with in-plane magnetization

Dirk Grundler

We investigate the magnonic band structure of in-plane magnetized two-dimensional magnonic crystals composed of cobalt dots embedded into a permalloy antidot lattice. Our analysis is based on the results of numerical calculations carried out by the plane w ...

2013

Lattice theoretic approach to space-time codes from division algebras

Cyril Becker

This master project on algebraic coding theory gathers various techniques from lattice theory, central simple algebras and algebraic number theory. The thesis begins with the formulation of the engineering problem into mathematical form. It presents how sp ...

2012

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

Anonymous and Fault-Tolerant Shared-Memory Computing

Rachid Guerraoui, Eric Ruppert

The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge them for re ...

2007

Anonymous and fault-tolerant shared-memory computing

Rachid Guerraoui, Eric Ruppert

Springer, Springer-Verlag2007

What Can Be Implemented Anonymously?

Rachid Guerraoui, Eric Ruppert

Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge the ...

2005

Efficient integration of automated speech recognition in the framework of dialogue-based vocal systems

In this work, we propose different strategies for efficiently integrating an automated speech recognition module in the framework of a dialogue-based vocal system. The aim is the study of different ways leading to the improvement of the quality and robustn ...

EPFL2005

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