Publication

In-Network View Synthesis for Interactive Multiview Video Systems

Publications associées (50)

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

Distributed throughput optimization over P2P mesh networks using diffusion adaptation

Ali H. Sayed

This work develops a decentralized adaptive strategy for throughput maximization over peer-to-peer (P2P) networks. The adaptive strategy can cope with changing network topologies, is robust to network disruptions, and does not rely on central processors. T ...

IEEE2012

Simultaneous Point Matching and 3D Deformable Surface Reconstruction

Pascal Fua, Appu Shaji, Aydin Varol

It has been shown that the 3D shape of a deformable surface in an image can be recovered by establishing correspondences between that image and a reference one in which the shape is known. These matches can then be used to set-up a convex optimization prob ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2010

A DSS to Optimize Facings on the Shelf of a Retail Store

Prem Kumar

This paper aims to maximize the profitability of a set of brand SKUs stocked at a particular retailer by optimizing the number of facings for each product. Based on the past data, a set of variables such as retail price of different SKUs, linear footage th ...

2010

Polynomial Filter Design for Quantized Consensus

Pascal Frossard, Effrosyni Kokiopoulou, Hyung Gon Park

We consider the problem of distributed average consensus where sensors exchange quantized data with their neighbors. We deploy a polynomial filtering approach in the network nodes in order to accelerate the convergence of the consensus problem. The quantiz ...

2010

New Hardness Results for Diophantine Approximation

Friedrich Eisenbrand, Thomas Rothvoss

We revisit simultaneous diophantine approximation, a classical problem from the geometry of numbers which has many applications in algorithms and complexity. The input of the decision version of this problem consists of a rational vector \alpha, an error b ...

Springer2009

Aligator: A mathematica package for invariant generation

Laura Ildiko Kovacs

We describe the new software package Aligator for automatically inferring polynomial loop invariants, The package combines algorithms from symbolic summation and polynomial algebra with computational logic, and is applicable to the rich class of P-solvable ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

Media Flow Rate Allocation in Multipath Networks

Pascal Frossard, Dan Jurca

We address the problem of joint path selection and video source rate allocation in multipath streaming in order to optimize a media specific quality of service. An optimization problem is proposed, which aims at minimizing a video distortion metric based o ...

2007

An Analytic Finite Capacity Queueing Network Model Capturing Congestion and Spillbacks

Michel Bierlaire, Carolina Osorio Pizano

Analytic queueing network models constitute a flexible tool for the study of network flow. These aggregate models are simple to manipulate and their analytic aspect renders them suitable for use within an optimization framework. Analytic queueing network m ...

2007

An analytic finite capacity queueing network model capturing congestion and spillbacks

Michel Bierlaire, Carolina Osorio Pizano

2007

Network Correlated Data Gathering with Explicit Communication: NP-Completeness and Algorithms

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree based communication structure, where the goal is to minimize the total trans- mission cost of transporting the information collected by the nodes, to the sink nod ...

2006