Network Correlated Data Gathering with Explicit Communication: NP-Completeness and Algorithms
Publications associées (373)
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.
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one another. Each terminal is equipped with an upper bound on the amount of traffic t ...
We consider the joint optimization of sensor placement and transmission structure for data gathering, where a given number of nodes need to be placed in a field such that the sensed data can be reconstructed at a sink within specified distortion bounds whi ...
We address the problem of joint path selection and rate allocation in multipath wireless streaming, in order to optimize a media specific quality of service. We leverage on the existence of multiple parallel wireless services, in order to enhance the recei ...
Econometric models play an important role in transportation analysis. Estimating more and more complex models becomes problematic. The associated log-likelihood function is highly nonlinear and non concave and the comlexity of the model requires constraint ...
Econometric models play an important role in transportation analysis. Estimating more and more complex models becomes problematic. The associated log-likelihood function is highly nonlinear and non concave and the comlexity of the model requires constraint ...
In the problem of lossy source coding with side-information, it is well known (Wyner and Ziv 1976) that knowledge of the side-information at the encoder improves the rate-distortion trade-off for binary sources and the Hamming distortion measure. We consid ...
We address the problem of joint path selection and rate allocation in multipath wireless streaming, in order to optimize a media specific quality of service. We leverage on the existence of multiple parallel wireless services, in order to enhance the recei ...
Sensor networks measuring correlated data are considered, where the task is to gather data from the network nodes to a sink. A specific scenario is addressed, where data at nodes are lossy coded with high-resolution, and the information measured by the nod ...
We consider the problem of compressing a binary symmetric i.i.d. source stream for two decoders, one of which has access to side-information. Kaspi found the rate-distortion tradeoff for this problem for general discrete memoryless sources for the two case ...
The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding ...