Publications de Dinkar Vasudevan

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.

Using Three States for Binary Consensus on Complete Graphs

Etienne Perron, Dinkar Vasudevan, Milan Vojnovic

We consider the binary consensus problem where each node in the network initially observes one of two states and the goal for each node is to eventually decide which one of the two states was initially held by the majority of the nodes. Each node contacts ...

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

On the Heegard-Berger/Kaspi problem with decoder cooperation

Dinkar Vasudevan

We consider decoder cooperation in the Heegard-Berger/Kaspi problem. The encoder sends a common description of a source to two decoders, one of which has side information. Cooperation between the two decoders is of the form of a limited capacity link from ...

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

Achievable Flows on Orthogonal Information Networks

Dinkar Vasudevan

We examine routing over two classes of orthogonal information networks. The first is a relay network with orthogonal inputs. The nodes in this network do not broadcast, but communicate to the different nodes via independent inputs. There is multiple access ...

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

Broadcast and Slepian-Wolf multicast over Aref Networks

Satish Babu Korada, Dinkar Vasudevan

We consider source coding over Aref networks. In particular we consider the following two problems: (i) multicasting correlated sources to a set of receivers, (ii) broadcasting sources to their respective receivers. For the first problem we show necessary ...

2008

On Broadcast with a Common Message over Networks

Satish Babu Korada, Dinkar Vasudevan

We consider the following communication problem over a directed graph. A source node wants to transmit a common message to a set of receiver nodes along with a private message to each of the receivers. We show a class of networks for which the achievable r ...

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

Cooperative source coding with encoder breakdown

Etienne Perron, Dinkar Vasudevan

This paper provides an inner bound to the rate-distortion region of a source coding setup in which two encoders are allowed some collaboration to describe a pair of discrete memoryless sources. We further require some robustness in case one of the encoders ...

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

Dinkar Vasudevan

Graph Chatbot

Chattez avec Graph Search

Cooperative coding on orthogonal information networks

Using Three States for Binary Consensus on Complete Graphs

On the Heegard-Berger/Kaspi problem with decoder cooperation

Achievable Flows on Orthogonal Information Networks

Broadcast and Slepian-Wolf multicast over Aref Networks

On Broadcast with a Common Message over Networks

Cooperative source coding with encoder breakdown

Algebraic gossip on Arbitrary Networks

On Broadcast with a Common Message over Networks

Cooperative coding on orthogonal information networks

On the Heegard-Berger/Kaspi problem with decoder cooperation

Cooperative source coding with encoder breakdown

Broadcast and Slepian-Wolf multicast over Aref Networks

Using Three States for Binary Consensus on Complete Graphs

Achievable Flows on Orthogonal Information Networks

Algebraic gossip on Arbitrary Networks