522 search results - page 56 / 105 » A Graph Theoretical Approach to Network Encoding Complexity |
118
click to vote
GG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
131
click to vote
TIT
2010
14 years 9 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...
DAC
2002
ACM
16 years 4 months ago
2002
ACM
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...
131
click to vote
ISCAS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
121
click to vote
AINA
2009
IEEE
15 years 9 months ago
2009
IEEE
—One of the main advantages of clustering algorithms is the ability to allow networks to be physically divided into smaller regions, thereby increasing the theoretical maximum nu...