7129 search results - page 379 / 1426 » Approximation Algorithms for Treewidth |
138
Voted
EDBT
2006
ACM
16 years 5 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
146
click to vote
EMSOFT
2004
Springer
15 years 10 months ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
137
Voted
SIGCOMM
1999
ACM
15 years 9 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
156
Voted
DAC
2010
ACM
15 years 8 months ago
2010
ACM
System optimization techniques based on dynamic voltage scaling (DVS) are widely used with the aim of reducing processor energy consumption. Inter-task DVS assigns the same voltag...
141
click to vote
COCOON
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...