Concept

Théorème de plongement de Whitney

Publications associées (19)

Tangent space estimation for smooth embeddings of Riemannian manifolds

Pascal Frossard, Elif Vural, Hemant Tyagi

Numerous dimensionality reduction problems in data analysis involve the recovery of low-dimensional models or the learning of manifolds underlying sets of data. Many manifold learning methods require the estimation of the tangent space of the manifold at a ...

2013

Low-Rank Matrix Completion By Riemannian Optimization

The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over the Riemannian ma ...

Siam Publications2013

Isogeometric Analysis and the Finite Cell method

Luca Dede'

The finite cell method (FCM) belongs to the class of immersed boundary methods, and combines the fictitious domain approach with high-order approximation, adaptive integration and weak imposition of unfitted Dirichlet boundary conditions. Its main idea con ...

2012

Estimation of the depth of anaesthesia from interacting physiological oscillators

Kumiko Oshima

Nowadays, physiological monitoring is imperative for the safety of medical operations. However, systems which monitor the depth of anaesthesia are still far from reliable, such that still some patients may experience the trauma of remaining conscious under ...

EPFL2008

Dysconnection Topography in Schizophrenia Revealed with State-Space Analysis of EEG

Martin Hasler, Reto Meuli, Kim Do, Oscar De Feo, Mahdi Jalili

Background The dysconnection hypothesis has been proposed to account for pathophysiological mechanisms underlying schizophrenia. Widespread structural changes suggesting abnormal connectivity in schizophrenia have been imaged. A functional counterpart of t ...

2007

Progressive Coding of 3-D Objects Based on Overcomplete Decompositions

Pascal Frossard, Pierre Vandergheynst, Ivana Tosic

This paper presents a progressive coding scheme for 3-D objects, based on overcomplete signal expansions on the 2-D sphere. Due to increased freedom in the basis construction, redundant expansions have shown interesting approximation properties in the deco ...

2006

Progressive coding of 3D objects based on overcomplete decompositions

Pascal Frossard, Pierre Vandergheynst, Ivana Tosic

This paper presents a progressive coding scheme for 3D objects, based on an overcomplete decomposition of the 3D model on a sphere. Due to increased freedom in the bases construction, redundant expansions have shown interesting approximation properties in ...

2005

Topological defects and gravity in theories with extra dimensions

Ewald Rössl

Recent proposals of large and infinite extra dimensions triggered a strong research activity in theories in which our universe is considered as a sub-manifold of some higher-dimensional space-time, a so-called 3-brane. In this context, it is generally assu ...

EPFL2004

A Green's tensor approach to the modeling of nanostructure replication and characterization

Olivier Martin

[1] We use the Green's tensor technique to study the optical processes taking place in configurations typically used for the replication and characterization of nanostructures. For the replication process we investigate light-coupling masks for optical con ...

2003

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