630 search results - page 59 / 126 » Hardness results for approximating the bandwidth |
204
Voted
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Current approaches for answering queries with imprecise constraints require user-specific distance metrics and importance measures for attributes of interest - metrics that are ha...
81
Voted
STOC
2004
ACM
16 years 27 days ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
134
click to vote
JTRES
2010
ACM
15 years 24 days ago
2010
ACM
In order to guarantee that real-time systems meet their timing specification, static execution time bounds need to be calculated. Not considering execution time predictability led...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we have proposed a dynamic buffer allocation algorithm for the prefix, based on the popularity of the videos. More cache blocks are allocated for most popular videos...