2957 search results - page 172 / 592 » The Complexity of Polynomial-Time Approximation |
119
click to vote
INFOCOM
2006
IEEE
16 years 4 days ago
2006
IEEE
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...
163
click to vote
COLT
2000
Springer
15 years 10 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
164
click to vote
CPHYSICS
2011
15 years 1 months ago
2011
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
188
click to vote
ECCC
2011
15 years 1 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
168
click to vote
ISCAS
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract— This paper presents an analog implementation of the complex wavelet transform using both the complex first order system (CFOS) and the Pad´e approximation. The comple...