Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
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 ...
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 ...
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. ...
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
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
