Publication

Quadratic serendipity element shape functions on general planar polygons

Related publications (54)

Graph Chatbot

Chat with Graph Search

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.

On Polygons Excluding Point Sets

Radoslav Fulek, Balázs Keszegh, Filip Moric

By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respectively, in the plane such that is in general position, and the convex hull of B c ...

Springer Japan2013

Approximate dynamic programming via sum of squares programming

Maryam Kamgarpour, Tyler Summers

We describe an approximate dynamic programming method for stochastic control problems on infinite state and input spaces. The optimal value function is approximated by a linear combination of basis functions with coefficients as decision variables. By rela ...

2013

A convex optimization framework for global tractography

Jean-Philippe Thiran, Alessandro Daducci, Alia Lemkaddem

In this article we present a novel approach for diffusion MRI global tractography. Our formulation models the signal in each voxel as a linear combination of fiber-tract basis func- tions, which consist of a comprehensive set of plausible fiber tracts that ...

2013

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

Transfer in Inverse Reinforcement Learning for Multiple Strategies

Aude Billard, Ajay Kumar Tanwani

We consider the problem of incrementally learning different strategies of performing a complex sequential task from multiple demonstrations of an expert or a set of experts. While the task is the same, each expert differs in his/her way of performing it. W ...

2013

Transfer in Inverse Reinforcement Learning for Multiple Strategies

Aude Billard, Ajay Kumar Tanwani

Ieee2013

The number of distinct distances from a vertex of a convex polygon

János Pach, Rom Pinchasi, Gabriel Nivasch

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is 13n/36 - O(1). I ...

2013

Learning Pattern Transformation Manifolds for Classification

Pascal Frossard, Elif Vural

Manifold models provide low-dimensional representations that are useful for analyzing and classifying data in a transformation-invariant way. In this paper we study the problem of jointly building multiple pattern transformation manifolds from a collection ...

2012

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

Critical behavior in ultrastrong-coupled oscillators

Vivishek Sudhir

We investigate the strong-coupling regime of a linear x-x coupled harmonic-oscillator system by performing a direct diagonalization of the Hamiltonian. It is shown that the x-x coupled Hamiltonian can be equivalently described by a Mach-Zehnder-type interf ...

2012