Concept

Present value

Publications associées (425)

Semantic Attribute Matching Networks

We present semantic attribute matching networks (SAM-Net) for jointly establishing correspondences and transferring attributes across semantically similar images, which intelligently weaves the advantages of the two tasks while overcoming their limitations ...

IEEE2019

A Framework to Evaluate the Benefit of Seismic Upgrading

Pierino Lestuzzi, Clotaire Michel

The framework to evaluate the benefit of seismic upgrading of Galanis et al. (2018) is compared to that present in the Swiss seismic code for existing buildings since 2004, updated in 2017. To illustrate the comparison, the example building of Galanis et a ...

2019

Non-contact polishing of single crystal diamond by ion beam etching

Niels Quack, Teodoro Graziosi, Sichen Mi

We propose a non-contact surface finishing method for brittle substrates by ion beam etching and we experimentally demonstrate polishing of (100) single crystal diamond surface. We model and simulate the polishing process, and verify the results experiment ...

2019

Reversible Pebbling Game for Quantum Memory Management

Giovanni De Micheli, Mathias Soeken, Giulia Meuli

Quantum memory management is becoming a pressing problem, especially given the recent research effort to develop new and more complex quantum algorithms. The only existing automatic method for quantum states clean-up relies on the availability of many extr ...

IEEE2019

Exact Synthesis of ESOP Forms

Giovanni De Micheli, Heinz Riener, Bruno Schmitt Antunes

We present an exact synthesis approach for computing Exclusive-or Sum-of-Products (ESOP) forms with a minimum number of product terms using Boolean satisfiability. Our approach finds one or more ESOP forms for a given Boolean function. The approach can dea ...

Springer2019

Tight Bounds for Online Edge Coloring

David Wajc

Vizing's celebrated theorem asserts that any graph of maximum degree Delta admits an edge coloring using at most Delta + 1 colors. In contrast, Bar-Noy, Motwani and Naor showed over a quarter century ago that the trivial greedy algorithm, which uses 2 Delt ...

IEEE COMPUTER SOC2019

Automatic Couplings with Mechanical Overload Protection for Modular Robots

Jamie Paik, Christoph Heinrich Belke

This paper presents an automatic coupling mechanism with mechanical overload protection for use in modular robotic systems. The genderless coupling incorporates a novel safety mechanism that disengages two modules at a pre-defined torque threshold. Several ...

2019

Function, evolution, and structure of J-domain proteins

Paolo De Los Rios, Alessandro Barducci, Pierre Goloubinoff

Hsp70 chaperone systems are very versatile machines present in nearly all living organisms and in nearly all intracellular compartments. They function in many fundamental processes through their facilitation of protein (re)folding, trafficking, remodeling, ...

2019

On Von Karman Modeling For Turbulent Flow Near A Wall

Jacques Rappaz, Jonathan Rochat

Mixing-length models are often used by engineers in order to take into account turbulence phenomena in a flow. This kind of model is obtained by adding a turbulent viscosity to the laminar one in Navier-Stokes equations. When the flow is confined between t ...

2019

Evolving biodiversity patterns in changing river networks

Andrea Rinaldo, Enrico Bertuzzo

Biodiversity patterns are governed by landscape structure and dispersal strategies of residing organisms. Landscape, however, changes, and dispersal strategies evolve with it. It is unclear how these biological and geomorphological changes interplay to aff ...

2019

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