Concept

Tri par tas

Publications associées (24)

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

Miniboxing: An Encoding for Specialization

Cristian Talau

In the presence of parametric polymorphism, erasure-based languages such as Java and Scala handle primitives (boolean values, integers and floating point numbers) in a suboptimal way: in order to provide a uniform representation on the low level, all primi ...

2012

Partitioned Algorithms for Fluid-Structure Interaction Problems in Haemodynamics

Fabio Nobile, Christian Vergara

We consider the fluid-structure interaction problem arising in haemodynamic applications. The finite elasticity equations for the vessel are written in Lagrangian form, while the Navier-Stokes equations for the blood in Arbitrary Lagrangian Eulerian form. ...

Birkhäuser-Verlag, Springer2012

This paper reports the result of the cooperation between KUL and EPFL on the numerical integration of Sommerfeld integrals (SI). Each institution is well-known for developing specific techniques suited for the evaluation of SI: double-exponential quadratur ...

2012

Scale Invariant Feature Transform on the Sphere: Theory and Applications

Michel Bierlaire, Jean-Philippe Thiran, Javier Cruz Mota, Iva Bogdanova Vandergheynst

A SIFT algorithm in spherical coordinates for omnidirectional images is proposed. This algorithm can generate two types of local descriptors, Local Spherical Descriptors and Local Planar Descriptors. With the first ones, point matching between two omnidire ...

Springer Verlag2012

Silence-Based Communication

Christina Fragouli

Communication complexity---the minimum amount of communication required---of computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst-case and ...

2010

Particle Swarm Optimization of Memory usage in Embedded Systems

David Atienza Alonso, José Luis Risco Martin

In this paper, we propose a dynamic, non-dominated sorting, multi-objective particle-swarm-based optimizer, named Hierarchical Non-dominated Sorting Particle Swarm Optimizer (H-NSPSO), for memory usage optimization in embedded systems. It significantly red ...

2009

Heterogeneous Gossip

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Davide Frey

Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Load-balancing is inherent in these protocols as the dissemination work is evenly spread among all nodes. Yet, large-scale distribut ...

2009

Gossiping Capabilities

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Davide Frey

Gossip-based protocols are now acknowledged as a sound basis to implement collaborative high-bandwidth content dissemination: content location is disseminated through gossip, the actual contents being subsequently pulled. In this paper, we present HEAP, HE ...

2008

Multiple-input multiple-output (MIMO) detection algorithms providing soft information for a subsequent channel decoder pose significant implementation challenges due to their high computational complexity. In this paper, we show how sphere decoding can be ...

2008

Soft-output sphere decoding: Performanceand implementation aspects

Andreas Peter Burg, Christoph Studer

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006