2957 search results - page 289 / 592 » The Complexity of Polynomial-Time Approximation |
154
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
151
Voted
ECCC
2010
15 years 6 months ago
2010
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
134
Voted
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, the Nonlinear Least-Squares (NLS) estimator for frequency offset in flat-fading channels is systematically derived. A simple interpolation technique is introduc...
222
click to vote
FOGA
2011
14 years 10 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
191
click to vote
PARA
2004
Springer
16 years 15 hour ago
2004
Springer
Abstract. This paper presents a method of solving initial value problems using Euler’s method, based on the domain of interval valued functions of a real variable. In contrast to...