78 search results - page 1 / 16 » Distributed Functional Compression through Graph Coloring |
DCC
2007
IEEE
14 years 4 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
TIT
2010
12 years 11 months ago
2010
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
EVOW
2010
Springer
13 years 10 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
HPCC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
GLOBECOM
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...