Concept

Art médiéval

Publications associées (37)

The Murten Panorama, from 2D to 4D

Sarah Irene Brutton Kenderdine, Daniel Norbert Jaquet

The Murten Panorama (10x100m) was realised by the renowned German panorama painter Louis Braun (1836-1916) in 1893, commissioned by a Swiss consortium. It commemorates the Swiss victory against the army of the Duchy of Burgundy in 1476 and exists as a symb ...

2019

Teaching Architecture - A dialogue

Inès Lamunière

What are the pressing questions in architecture – in teaching, research and practice? Based on their many years of experience, professors Inès Lamunière and Laurent Stalder come together in five meetings to search for answers. They describe an approach to ...

Birkhäuser2019

Recurrent U-Net for Resource-Constrained Segmentation

Pascal Fua, Mathieu Salzmann, Joachim Ludovic Hugonot, Wei Wang, Kaicheng Yu

State-of-the-art segmentation methods rely on very deep networks that are not always easy to train without very large training datasets and tend to be relatively slow to run on standard GPUs. In this paper, we introduce a novel recurrent U-Net architecture ...

IEEE COMPUTER SOC2019

“RiNo Motel”, Denver CO

Léonore Dor, Fanny Mignon

L'Amérique est un pays qui se sillonne parce qu'il est vaste et ses paysages infinis. Porté par le goût de la liberté, l'esprit du motel se répand. Mais le mythe est noir. Le “River North Art District Motel” est d'un nouveau type, entre rétro et futurisme. ...

2017

Revisiting Taxonomy Induction over Wikipedia

Amit Gupta

Guided by multiple heuristics, a unified taxonomy of entities and categories is distilled from the Wikipedia category network. A comprehensive evaluation, based on the analysis of upward generalization paths, demonstrates that the taxonomy supports general ...

2016

Optimistic Concurrency with OPTIK

Rachid Guerraoui, Vasileios Trigonakis

We introduce OPTIK, a new practical design pattern for designing and implementing fast and scalable concurrent data structures. OPTIK relies on the commonly-used technique of version numbers for detecting conflicting concurrent operations. We show how to i ...

ACM Press2016

K Users Caching Two Files: An Improved Achievable Rate

Michael Christoph Gastpar, Saeid Sahraei

Caching is an approach to smoothen the variability of traffic over time. Recently it has been proved that the local memories at the users can be exploited for reducing the peak traffic in a much more efficient way than previously believed. In this work we ...

Ieee2016

Brief Introduction to the Special Issue on Behavior Understanding for Arts and Entertainment

Oya Aran

This editorial introduction describes the aims and scope of the special issue of the ACM Transactions on Interactive Intelligent Systems on Behavior Understanding for Arts and Entertainment, which is being published in issues 2 and 3 of volume 5 of the jou ...

2015

Structured sparsity for spatially coherent fibre orientation estimation in diffusion MRI

Jean-Philippe Thiran, Yves Wiaux, Alessandro Daducci, Anna Auria Rasclosa

We propose a novel formulation to solve the problem of intra-voxel reconstruction of the fibre orientation distribution function (FOD) in each voxel of the white matter of the brain from diffusion MRI data. The majority of the state-of-the-art methods in t ...

Elsevier2015

TC 238-SCM - hydration and microstructure of concrete with SCMs: State of the art on methods to determine degree of reaction of SCMs

Karen Scrivener, Barbara Lothenbach, Ruben Anton Snellings

This paper is the work of working group 2 of the RILEM TC 238-SCM. Its purpose is to review methods to estimate the degree of reaction of supplementary cementitious materials in blended (or composite) cement pastes. We do not consider explicitly the wider ...

Springer2015

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