2095 search results - page 292 / 419 » Improved pebbling bounds |
LATIN
2010
Springer
14 years 5 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
ICDCS
2009
IEEE
14 years 5 months ago
2009
IEEE
Though plenty of research has been conducted to improve Internet P2P streaming quality perceived by endusers, little has been known about the upper bounds of achievable performanc...
ISBRA
2009
Springer
14 years 4 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
GLOBECOM
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract— We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study ...
ICC
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract— A common assumption in the network coding literature is that the users are cooperative and will not pursue their own interests. However, this assumption can be violated...