3415 search results - page 156 / 683 » Lower Bounds for Kernelizations |
141
click to vote
DAGSTUHL
2008
15 years 6 months ago
2008
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...
133
click to vote
MP
2006
15 years 4 months ago
2006
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
139
click to vote
MFCS
1997
Springer
15 years 8 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
140
Voted
CPM
2008
Springer
15 years 6 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
134
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input singleoutput (SISO) relay ch...