2283 search results - page 247 / 457 » Bounds of Graph Characteristics |
136
click to vote
TIT
2010
14 years 10 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...
140
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
169
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
149
click to vote
BIOCOMP
2008
15 years 4 months ago
2008
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...
137
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...