Publications associées (24)

Modular Functions and Special Cycles

Maryna Viazovska

In this thesis we study algebraic cycles on Shimura varieties of orthogonal type. Such varieties are a higher dimensional generalization of modular curves and their important feature is that they have natural families of algebraic cycles in all codimesions ...
Rheinische Friedrich-Wilhelms-Universität Bonn2013

Combining Discriminant and Topographic Information in BCI: Preliminary Results on Stroke Patients

José del Rocio Millán Ruiz, Ricardo Andres Chavarriaga Lozano, Robert Leeb, Andrea Biasiucci, Benjamin Hamner

Non–Invasive Brain–Computer Interfaces (BCI) convey a great potential in the field of stroke rehabilitation, where the continuous monitoring of mental tasks execution could support the positive effects of standard therapies. In this paper we combine time-f ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

An adaptive finite-volume method for a model of two-phase pedestrian flow

Ricardo Esteban Ruiz Baier

A flow composed of two populations of pedestrians moving in different directions is modeled by a two-dimensional system of convection-diffusion equations. An efficient simulation of the two-dimensional model is obtained by a finite-volume scheme combined w ...
American Institute of Mathematical Sciences2011

Sur la méthode de Buser-Silhol pour l'uniformisation des surfaces de Riemann hyperelliptiques

Grégoire Aubry

The Uniformization Theorem due to Koebe and Poincaré implies that every compact Riemann surface of genus greater or equal to 2 can be endowed with a metric of constant curvature – 1. On the other hand, a compact Riemann surface is a complex algebraic curve ...
EPFL2010

Arithmetic Bounds-Lenstra's Constant and Torsion of K-Groups

Julien Houriet

This thesis is concerned with computations of bounds for two different arithmetic invariants. In both cases it is done with the intention of proving some algebraic or arithmetic properties for number fields. The first part is devoted to computations of low ...
EPFL2010

On the computational complexity of periodic scheduling

Thomas Rothvoss

In periodic scheduling jobs arrive regularly and have to be executed on one or several machines or processors. An enormous amount of literature has been published on this topic, e.g. the founding work of Liu & Layland [LL73] is among the top cited computer ...
EPFL2009

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.