4894 search results - page 85 / 979 » The Guarding Problem - Complexity and Approximation |
118
Voted
ICC
2008
IEEE
15 years 9 months ago
2008
IEEE
—In this paper, we propose an iterative joint DA/DD channel estimation algorithm for known symbol padding (KSP) OFDM. The pilot symbols used to estimate the channel are not only ...
121
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
Abstract—In this paper, we introduce FlowSifter, a systematic framework for online application protocol field extraction. FlowSifter introduces a new grammar model Counting Regu...
140
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
123
Voted
APPROX
1998
Springer
15 years 6 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
112
Voted
AAAI
2008
15 years 5 months ago
2008
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...