全文获取类型
收费全文 | 103篇 |
免费 | 16篇 |
国内免费 | 4篇 |
专业分类
综合类 | 13篇 |
数学 | 110篇 |
出版年
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 4篇 |
2019年 | 6篇 |
2018年 | 7篇 |
2017年 | 5篇 |
2016年 | 4篇 |
2015年 | 3篇 |
2014年 | 8篇 |
2013年 | 6篇 |
2012年 | 6篇 |
2011年 | 5篇 |
2010年 | 2篇 |
2009年 | 4篇 |
2008年 | 6篇 |
2007年 | 7篇 |
2006年 | 4篇 |
2005年 | 6篇 |
2004年 | 3篇 |
2003年 | 5篇 |
2002年 | 3篇 |
2001年 | 4篇 |
2000年 | 7篇 |
1999年 | 1篇 |
1998年 | 4篇 |
1997年 | 2篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
排序方式: 共有123条查询结果,搜索用时 31 毫秒
1.
2.
3.
Roee David Elazar Goldenberg Robert Krauthgamer 《Random Structures and Algorithms》2017,51(4):607-630
We study the problem of reconstructing a low‐rank matrix, where the input is an n × m matrix M over a field and the goal is to reconstruct a (near‐optimal) matrix that is low‐rank and close to M under some distance function Δ. Furthermore, the reconstruction must be local, i.e., provides access to any desired entry of by reading only a few entries of the input M (ideally, independent of the matrix dimensions n and m). Our formulation of this problem is inspired by the local reconstruction framework of Saks and Seshadhri (SICOMP, 2010). Our main result is a local reconstruction algorithm for the case where Δ is the normalized Hamming distance (between matrices). Given M that is ‐close to a matrix of rank (together with d and ), this algorithm computes with high probability a rank‐d matrix that is ‐close to M. This is a local algorithm that proceeds in two phases. The preprocessing phase reads only random entries of M, and stores a small data structure. The query phase deterministically outputs a desired entry by reading only the data structure and 2d additional entries of M. We also consider local reconstruction in an easier setting, where the algorithm can read an entire matrix column in a single operation. When Δ is the normalized Hamming distance between vectors, we derive an algorithm that runs in polynomial time by applying our main result for matrix reconstruction. For comparison, when Δ is the truncated Euclidean distance and , we analyze sampling algorithms by using statistical learning tools. A preliminary version of this paper appears appears in ECCC, see: http://eccc.hpi-web.de/report/2015/128/ © 2017 Wiley Periodicals, Inc. Random Struct. Alg., 51, 607–630, 2017 相似文献
4.
任颜波 《数学年刊A辑(中文版)》2015,36(2):119-128
对3类由凹函数生成的弱Orlicz鞅空间建立了相应的弱原子分解.作为应用,首先给出了这些弱Orlicz鞅空间上次线性算子有界的一个充分条件,并在此基础上证明了一些弱型鞅不等式,然后证明了关于这些弱Orlicz鞅空间的Marcinkiewicz型插值定理. 相似文献
5.
受Peng-中心极限定理的启发,本文主要应用G-正态分布的概念,放宽Peng-中心极限定理的条件,在次线性期望下得到形式更为一般的中心极限定理.首先,将均值条件E[X_n]=ε[X_n]=0放宽为|E[X_n]|+|ε[X_n]|=O(1/n);其次,应用随机变量截断的方法,放宽随机变量的2阶矩与2+δ阶矩条件;最后,将该定理的Peng-独立性条件进行放宽,得到卷积独立随机变量的中心极限定理. 相似文献
6.
7.
通过放宽尺寸条件,得到了一类具有分数次积分性质的次线性算子从Herz型Hardy空间到(弱)Herz型Hardy空间有界性的判定条件,以及端点处的弱型估计. 相似文献
8.
In this paper,we investigate the problem:How big are the increments of G-Brownian motion.We obtain the Csrg and R′ev′esz’s type theorem for the increments of G-Brownian motion.As applications of this result,we get the law of iterated logarithm and the Erds and R′enyi law of large numbers for G-Brownian motion.Furthermore,it turns out that our theorems are natural extensions of the classical results obtained by Csrg and R′ev′esz(1979). 相似文献
9.
In this paper, we deal with existence and multiplicity of solutions of Kirchhoff‐type problems Under more relaxed assumptions on f, we establish some existence criteria to guarantee that the preceding problem has at least one or infinitely many nontrivial solutions by using the genus properties in critical point theory. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
10.
Shi Guoliang 《数学季刊》1998,(3)
§1. IntroductionTheexistencefortheboundaryvalueproblemshavebeenwidelystudiedrecently.Inthispaper,wewilldiscusstheBVPofthefollowingconditions:u(n)+a(t)f(u)=0,0<t<1,u(k)(0)=0,0kn-2(1.1)u(1)=0, where(h1)a:(0,1)→(0,∞)isacontinuousfunction.(h2)f:[0,∞)→[… 相似文献