7129 search results - page 376 / 1426 » Approximation Algorithms for Treewidth |
146
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
186
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
150
click to vote
SIGMOD
1999
ACM
15 years 9 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
125
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
129
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...