903 search results - page 9 / 181 » On the reduction of a random basis |
117
click to vote
FSTTCS
1991
Springer
15 years 3 months ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
This paper consider the problem of how to evaluate the efficiency of a 3D continuous functional HRTF model in representing measured data. The proposed method is based on Karhunen...
FSTTCS
1992
Springer
15 years 3 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
STOC
2007
ACM
15 years 12 months ago
2007
ACM
We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th
FOCS
2010
IEEE
14 years 9 months ago
2010
IEEE
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...