Concept

Revêtement (mathématiques)

Publications associées (32)

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

Unsplittable Coverings in the Plane

János Pach

A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of its members. A 1-fold covering is called a covering. The problem of splitting multiple coverings into several coverings was motivated by classical density est ...

Springer-Verlag Berlin2016

Unsplittable coverings in the plane

János Pach

Academic Press Inc Elsevier Science2016

Beyond Developable: Computational Design and Fabrication with Auxetic Materials

Mark Pauly, Sofien Bouaziz, Bailin Deng, Mina Konakovic Lukovic

We present a computational method for interactive 3D design and rationalization of surfaces via auxetic materials, i.e., flat flexible material that can stretch uniformly up to a certain extent. A key motivation for studying such material is that one can a ...

Assoc Computing Machinery2016

Timber Folded Plate Structures – Folded Form Analysis

Yves Weinand, Christopher Werner Matthias Robeller, Andrea Stitic

This paper analyses the potential of different possible folded form topologies for generating timber folded surface structures. The main advantage of such structures lies primarily in the realm of ecology and sustainability. By offering an integral way of ...

2015

Embedding functor for classical groups and Brauer–Manin obstruction

Eva Bayer Fluckiger, Ting-Yu Lee

Let K be a global field of characteristic not 2. The embedding problem for maximal tori in a classical group G can be described in terms of algebras with involution. The aim of this paper is to give an explicit description of the obstruction group to the H ...

2015

Governance of competition and performance in European railways: An analysis of five cases

Matthias Finger

Based on extensive qualitative research, this article analyzes the governance of competition in European railways and relates this to their performance via five case studies covering the Netherlands, France, Germany, Sweden and the UK. Even though some tre ...

Elsevier Sci Ltd2014

Learning Smooth Pattern Transformation Manifolds

Pascal Frossard, Elif Vural

Manifold models provide low-dimensional representations that are useful for processing and analyzing data in a transformation-invariant way. In this paper, we study the problem of learning smooth pattern transformation manifolds from image sets that are ob ...

Institute of Electrical and Electronics Engineers2013

A counter-example to a conjecture of Felix

If X is a simply connected space of finite type, then the rational homotopy groups of the based loop space of X possess the structure of a graded Lie algebra, denoted L-x. The radical of L-x, which is an important rational homotopy invariant of X, is of fi ...

Elsevier2011

Parallel Programmable Asynchronous Neighborhood Mechanism for Kohonen SOM Implemented in CMOS Technology

Rafal Tomasz Dlugosz

We present a new programmable neighborhood mechanism for hardware implemented Kohonen self-organizing maps (SOMs) with three different map topologies realized on a single chip. The proposed circuit comes as a fully parallel and asynchronous architecture. T ...

Institute of Electrical and Electronics Engineers2011

Covering Cubes and the Closest Vector Problem

Friedrich Eisenbrand, Martin Niemeier, Nicolai Hähnle

We provide the currently fastest randomized (1+epsilon)-approximation algorithm for the closest vector problem in the infinity-norm. The running time of our method depends on the dimension n and the approximation guarantee epsilon by 2^(O(n))(log(1/epsilon ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011