Publication

Random Access with Physical-layer Network Coding

Publications associées (48)

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

Physical-layer Network Coding on the Random-access Channel

Michael Christoph Gastpar, Jasper Goseling

We consider a physical-layer network coding strat- egy for the random-access channel, based on compute-and- forward. When packets collide, it is possible to reliably recover a linear combination of the packets at the receiver. Over many rounds of transmiss ...

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

Approximate dynamic programming for stochastic reachability

Maryam Kamgarpour, Tyler Summers

In this work we illustrate how approximate dynamic programing can be utilized to address problems of stochastic reachability in infinite state and control spaces. In particular we focus on the reach-avoid problem and approximate the value function on a lin ...

2013

Counting Sheaves Using Spherical Codes

Philippe Michel

Using the Riemann Hypothesis over finite fields and bounds for the size of spherical codes, we give explicit upper bounds, of polynomial size with respect to the size of the field, for the number of geometric isomorphism classes of geometrically irreducibl ...

International Press2013

Exploring Local Modifications for Constrained Meshes

Mark Pauly, Sofien Bouaziz, Bailin Deng, Yuliy Gennadievich Schwartzburg, Mario Moacir Deuss

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 ...

Wiley-Blackwell2013

NURBS-Based BEM Implementation of High-Order Surface Impedance Boundary Conditions

Annalisa Buffa, Rafael Vazquez Hernandez

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 ...

2012

A constraint sampling approach for multi-stage robust optimization

Daniel Kuhn

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 ...

Elsevier2012

Spectral Sharpening by Spherical Sampling

Sabine Süsstrunk

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 ...

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

Reliable Physical Layer Network Coding

Michael Christoph Gastpar

When two or more users in a wireless network transmit simultaneously, their electromagnetic signals are linearly superimposed on the channel. As a result, a receiver that is interested in one of these signals sees the others as unwanted interference. This ...

2011