2766 search results - page 264 / 554 » Algorithms for trigonometric polynomials |
160
click to vote
ICC
2007
IEEE
16 years 27 days ago
2007
IEEE
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
196
click to vote
CSL
2007
Springer
16 years 22 days ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
203
click to vote
CCECE
2006
IEEE
16 years 19 days ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
161
click to vote
COMPGEOM
2006
ACM
16 years 16 days ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
158
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...