Publication

Counting Sheaves Using Spherical Codes

Publications associées (38)

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

Exploring Local Modifications for Constrained Meshes

Mark Pauly, Sofien Bouaziz, Bailin Deng, Yuliy Gennadievich Schwartzburg, Mario Moacir Deuss

Mesh editing under constraints is a challenging task with numerous applications in geometric modeling, industrial design, and architectural form finding. Recent methods support constraint-based exploration of meshes with fixed connectivity, but commonly la ...

Wiley-Blackwell2013

Random Access with Physical-layer Network Coding

Michael Christoph Gastpar, Jasper Goseling

Browse Conference Publications > Information Theory and Applic ... Back to Results | Next » Help Random access with physical-layer network coding This paper appears in: Information Theory and Applications Workshop (ITA), 2013 Date of Conference: 10-15 Feb. ...

2013

Stochastic Exploration of Ambiguities for Non-Rigid Shape Recovery

Pascal Fua

Recovering the 3D shape of deformable surfaces from single images is known to be a highly ambiguous problem because many different shapes may have very similar projections. This is commonly addressed by restricting the set of possible shapes to linear comb ...

Institute of Electrical and Electronics Engineers2013

NURBS-Based BEM Implementation of High-Order Surface Impedance Boundary Conditions

Annalisa Buffa, Rafael Vazquez Hernandez

When implementing high-order surface impedance boundary conditions in collocation boundary element method (BEM) with constant or linear elements, difficulties arise due to the computation of the curvature of the conductors and of the tangential derivatives ...

2012

A constraint sampling approach for multi-stage robust optimization

Daniel Kuhn

We propose a tractable approximation scheme for convex (not necessarily linear) multi-stage robust optimization problems. We approximate the adaptive decisions by finite linear combinations of prescribed basis functions and demonstrate how one can optimize ...

Elsevier2012

Characterization of T-splines with reduced continuity order on T-meshes

Annalisa Buffa, Mithlesh Kumar

The use of T-splines [30] in Isogeometric Analysis [24] has been proposed in [5] as a tool to enhance the flexibility of isogeometric methods. If T-splines are a very general concept, their success in isogeometric analysis relies upon some basic properties ...

2012

Spectral Sharpening by Spherical Sampling

Sabine Süsstrunk

There are many works in colour that assume illumination change can be modelled by multiplying sensor responses by individual scaling factors. The early research in this area are sometimes grouped under the heading von Kries adaptation: the scaling factors ...

2012

Deformable shape models for 2D object segmentation

Robin Thandiackal

Given a set of images showing individual 2D instances of an object class, the goal is to learn object class deformation in 2D for segmentation automatically. Class deformation is modelled by linear combinations of basis shapes. Usually, given segmentation ...

2011

Exploring Ambiguities for Monocular Non-Rigid Shape Estimation

Pascal Fua

Recovering the 3D shape of deformable surfaces from single images is difficult because many different shapes have very similar projections. This is commonly addressed by restricting the set of possible shapes to linear combinations of deformation modes and ...

2010

Analysis of an algebraic Petrov-Galerkin smoothed aggregation multigrid method

We give a convergence estimate for a Petrov-Galerkin Algebraic Multigrid method. In this method, the prolongations are defined using the concept of smoothed aggregation while the restrictions are simple aggregation operators. The analysis is carried out by ...

2008