Concept

Nombre ordinal

Publications associées (37)

Gabor dual windows using convex optimization

Redundant Gabor frames admit an infinite number of dual frames, yet only the canonical dual Gabor system, con- structed from the minimal l2-norm dual window, is widely used. This window function however, might lack desirable properties, such as good time-f ...

2013

A reduced basis hybrid method for the coupling of parametrized domains represented by fluidic networks

Alfio Quarteroni, Gianluigi Rozza, Laura Iapichino

In this paper we propose a reduced basis hybrid method (RBHM) for the approximation of partial differential equations in domains represented by complex networks where topological features are recurrent. The RBHM is applied to Stokes equations in domains wh ...

Elsevier2012

On equalities involving integrals of the logarithm of the Riemann zeta-function and equivalent to the Riemann hypothesis

By using the generalized Littlewood theorem about a contour integral involving the logarithm of an analytic function, we show how an infinite number of integral equalities involving integrals of the logarithm of the Riemann zeta-function and equivalent to ...

Springer US2012

Network Coding with Computation Alignment

Michael Christoph Gastpar, Naveen Goela

Determining the capacity of multi-receiver networks with arbitrary message demands is an open problem in the network coding literature. In this paper, we consider a multi-source, multi-receiver symmetric deterministic network model parameterized by channel ...

Ieee2012

Computation in Multicast Networks: Function Alignment and Converse Theorems

Michael Christoph Gastpar, Naveen Goela

The classical problem in network coding theory considers communication over multicast networks. Multiple transmitters send independent messages to multiple receivers which decode the same set of messages. In this work, computation over multicast networks i ...

2012

On Sphere-Filling Ropes

Henryk Gerlach

What is the longest rope on the unit sphere? Intuition tells us that the answer to this packing problem depends on the rope's thickness. For a countably infinite number of prescribed thickness values we construct and classify all solution curves. The simpl ...

2011

Functions With Orthogonal Hessian

Bernard Dacorogna

A Dirichlet problem for orthogonal Hessians in two dimensions is explicitly solved, by characterizing all piecewise C-2 functions u Omega subset of R-2 -> R with orthogonal Hessian in terms of a property named "second order angle condition" as in (1 1) ...

2010

Top-Down vs Bottom-Up Model-Based Methodologies for Distributed Control: A Comparative Experimental Study

Alcherio Martinoli, William Christopher Evans, Grégory Mermoud, Utkarsh Upadhyay

Model-based synthesis of distributed controllers for multi-robot systems is commonly approached in either a top-down or bottom-up fashion. In this paper, we investigate the experimental challenges of both approaches, with a special emphasis on resource-con ...

Springer-Verlag2010

Quotient method for controlling the acrobot

Dominique Bonvin, Philippe Müllhaupt

This paper describes a two-sweep control design method to stabilize the acrobot, an input-afﬁne under-actuated system, at the upper equilibrium point. In the forward sweep, the system is successively reduced, one dimension at a time, until a two-dimensiona ...

2009

Modeling of direct load transmission in sandwich beams with lightweight concrete

Thomas Keller, Till Vallée, Erika Schaumann

The direct load transmission behavior of hybrid sandwich beams consisting of a bottom fiber-reinforced polymer skin and a top concrete skin was investigated experimentally. The sandwich core consisted of lightweight concretes of different brittleness (sand ...

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