搜索结果: 1-7 共查到“理学 Subexponential”相关记录7条 . 查询时间(0.046 秒)
General nonexact oracle inequalities for classes with a subexponential envelope
Statistical learning fast rates of convergence oracle inequalities regularization classification aggregation model selection
2012/6/21
We show that empirical risk minimization procedures and regularized empirical risk minimization procedures satisfy nonexact oracle inequalities in an unbounded framework, under the assumption that the...
Achieving a vanishing SNR-gap to exact lattice decoding at a subexponential complexity
SNR-gap subexponential complexity Information Theory
2011/9/15
Abstract: The work identifies the first lattice decoding solution that achieves, in the general outage-limited MIMO setting and in the high-rate and high-SNR limit, both a vanishing gap to the error-p...
Constructing elliptic curve isogenies in quantum subexponential time
Constructing elliptic curve isogenies quantum subexponential time
2011/3/3
Given two elliptic curves over a finite field having the same cardinality and endomorphism
ring, it is known that the curves admit an isogeny between them, but finding such an isogeny is believed to ...
Second order subexponential distributions with finite mean and their applications to subordinated distributions
Second order subexponential distributions subordinated distributions
2010/11/22
Consider a probability distribution subordinate to a subexponential distribution with finite mean. In this paper, we discuss the second order tail behavior of the subordinated distribution within a r...
Uniform Approximations for the M/G/1 Queue with Subexponential Processing Times
Uniform approximations M/G/1 queue subexponential distributions
2010/12/14
This paper studies the asymptotic behavior of the steady-state waiting time, W 1, of the
M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overf...
WEAKENING ASSUMPTIONS FOR DETERMINISTIC SUBEXPONENTIAL TIME NON-SINGULAR MATRIX COMPLETION
WEAKENING ASSUMPTIONS DETERMINISTIC NON-SINGULAR MATRIX
2012/11/30
Kabanets and Impagliazzo [9] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinear polynomial f...
We present a new, more elementary proof of the Freedman-Teichner result that the geometric classification techniques (surgery, s-cobordism, and pseudoisotopy) hold for topological 4-manifolds with gr...