Concept

Équation quintique

Publications associées (17)

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...

Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022

A Computational Comparison Between Isogeometric Analysis and Spectral Element Methods: Accuracy and Spectral Properties

Alfio Quarteroni, Ondine Gabrielle Chanon

In this paper, we carry out a systematic comparison between the theoretical properties of Spectral Element Methods and NURBS-based Isogeometric Analysis in its basic form, that is in the framework of the Galerkin method, for the approximation of the Poisso ...

SPRINGER/PLENUM PUBLISHERS2020

Stress intensity factors for axial semi-elliptical surface cracks and embedded elliptical cracks at longitudinal butt welded joints of steel-lined pressure tunnels and shafts considering weld shape

Anton Schleiss, Pedro Filipe De Almeida Manso, Alexandre Jean Pachoud

When for steel liners of pressure tunnels and shafts high-strength steels are used, welded joints are subject to the risk of hydrogen induced cold-cracking in the base material. Longitudinal butt welded joints are critical regions as they are loaded transv ...

Elsevier2017

Smooth Shapes with Spherical Topology: Beyond Traditional Modeling, Efficient Deformation, and Interaction

Michaël Unser, Pablo Garcia-Amorena Garcia, Daniel Andreas Schmitter

Existing shape models with spherical topology are typically designed either in the discrete domain using interpolating polygon meshes or in the continuous domain using smooth but non-interpolating schemes such as subdivision or NURBS. Both polygon models a ...

2017

Smoothly Deformable Spheres: Modeling, Deformation, and Interaction

Michaël Unser, Pablo Garcia-Amorena Garcia, Daniel Andreas Schmitter

ACM2016

A Rescaled Localized Radial Basis Function Interpolation On Non-Cartesian And Nonconforming Grids

Alfio Quarteroni, Simone Deparis, Davide Forti

In this paper we propose a rescaled localized radial basis function (RL-RBF) interpolation method, based on the use of compactly supported radial basis functions. Starting from the classical RBF interpolation technique, we introduce a rescaling that allows ...

Siam Publications2014

Mixing patterns from the groups Sigma(n phi)

Lorenzo Vitale

We survey the mixing patterns which can be derived from the discrete groups Sigma(36 x 3), Sigma( 72 x 3), Sigma(216 x 3) and Sigma(360 x 3), if these are broken to Abelian subgroups G(e) and G(nu) in the charged lepton and neutrino sector, respectively. S ...

Iop Publishing Ltd2014

Some algebro-geometric solutions for the coupled modified Kadomtsev-Petviashvili equations arising from the Neumann type systems

Jinbing Chen

A treatment is described for getting some algebro-geometric solutions of the coupled modified Kadomtsev-Petviashvili (cmKP) equations and a hierarchy of 1 + 1 dimensional integrable nonlinear evolution equations (INLEEs) by using the Neumann type systems t ...

American Institute of Physics2012

On the use of graphs in discrete tomography

Dominique de Werra, Bernard Ries

In this tutorial paper, we consider the basic image reconstruction problem which stems from discrete tomography. We derive a graph theoretical model and we explore some variations and extensions of this model. This allows us to establish connections with s ...

2010

Graph coloring with cardinality constraints on the neighborhoods

Dominique de Werra, Bernard Ries

Extensions and variations of the basic problem of graph coloring are introduced. The problem consists essentially in finding in a graph G a k-coloring, i.e., a partition V-1,...,V-k of the vertex set of G such that, for some specified neighborhood (N) over ...

2009

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