151 search results - page 15 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
122
click to vote
SODA
2007
ACM
15 years 5 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
142
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
120
click to vote
DATE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
110
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
136
click to vote
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...