按相关排序
全部格式
全部页数
时间不限
只看优质
只看可投资
展开
排序：
相关 最多阅读 最新上传
格式：
全部 doc pdf ppt xls txt 豆单
页数：
全部 1-8页 9-100页 100页以上
时间：
全部 2024年 2023年 2022年及以前
25
A New Central Limit Theorem under Sublinear.pdf
A New Central Limit Theorem under SublinearA New Central Limit Theorem under SublinearA New Central Limit Theorem under Sublinear
收藏到书房
57
THE NODAL SET OF SOLUTIONS TO SOME ELLIPTIC PROBLEMS SUBLINEAR EQUATIONS, AND UNSTABLE TWO-PHASE MEMBRANE PROBLEM.pdf
THE NODAL SET OF SOLUTIONS TO SOME ELLIPTIC PROBLEMS SUBLINEAR EQUATIONS, AND UNSTABLE TWO-PHASE MEMBRANE PROBLEM
收藏到书房
70
Existence and structure of the set of positive solutions of a general class of sublinear elliptic non-classical mixed boundary value problems.pdf
Existence and structure of the set of positive solutions of a general class of sublinear elliptic non-classical mixed boundary value problems
收藏到书房
60
Global well-posedness and grow-up rate of solutions for a sublinear pseudoparabolic equation.pdf
Global well-posedness and grow-up rate of solutions for a sublinear pseudoparabolic equation
收藏到书房
50
Sublinear-time decremental algorithms for single-source….pdf
Sublinear-time decremental algorithms for single-source…
收藏到书房
44
Generalized Wasserstein Distance and Weak Convergence of Sublinear Expectations.pdf
Generalized Wasserstein Distance and Weak Convergence of Sublinear Expectations
收藏到书房
74
Sublinear time algorithms cse次线性时间算法CSE.proj.ac.il.pptx
Sublinear time algorithms cse次线性时间算法CSE.proj.ac.il
收藏到书房
49
Sublinear Optimization for Machine Learning - Technion.pdf
Sublinear Optimization for Machine Learning - Technion
收藏到书房
34
classification of razor blades to the filtration equation-the sublinear case.pdf
classification of razor blades to the filtration equation—the sublinear case
收藏到书房
38
Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size.pdf
We raise the question of approximating compressibility of a string with respect to a xed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: run-length encoding (RLE) and Lempel-Ziv (LZ), and present algorithms and lower bounds for approximating compressibility with respect to both schemes. While we obtain much stronger results for RLE in terms of the eciency of the algorithms, our investi- gation of LZ yields results whose interest goes beyond the initial questions we set out to study. In particular, we prove combinatorial structural lemmas that relate compressibility of a string with respect to Lempel-Ziv to the number of distinct short substrings contained in it. We also show that compressibility with respect to LZ is related to approximating the support size of a distribution. This problem has been considered under dierent guises in the literature. We prove a strong lower bound for it, at the heart of which is a con
1篇相似文档
收藏到书房

向豆丁求助：有没有SUBLINEAR?

95%的用户最终下载了:
如要投诉违规内容，请联系我们按需举报；如要提出意见建议，请到社区论坛发帖反馈。