设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
在“
SpringerLink电子期刊
”中,
命中:
8
条,耗时:0.0119981 秒
1.
Inverse Littlewood–Offord Problems for Quasi-norms
作者:
Omer Friedland
;
Ohad Giladi
;
Olivier
Guédon
关键词:
Concentration function
;
Quasi
;
norm
;
Inverse Littlewood
;
Offord problems
刊名:Discrete & Computational Geometry
出版年:2017
2.
Small Ball Estimates for Quasi-Norms
作者:
Omer Friedland
;
Ohad Giladi
;
Olivier
Guédon
关键词:
Small ball estimates
;
Sobolev norm
;
Littlewood–Offord type estimates
刊名:Journal of Theoretical Probability
出版年:2016
3.
Community detection in sparse networks via Grothendieck’s inequality
作者:
Olivier
Guédon
;
Roman Vershynin
刊名:Probability Theory and Related Fields
出版年:2016
4.
Sparsity and non-Euclidean embeddings
作者:
Omer Friedland
;
Olivier
Guédon
刊名:Israel Journal of Mathematics
出版年:2013
5.
Subspaces and Orthogonal Decompositions Generated by Bounded Orthogonal Systems
作者:
Olivier
Guédon
;
Shahar Mendelson
;
Alain Pajor and Nicole Tomczak-Jaegermann
关键词:
Empirical processes
;
generic chaining
;
bounded orthogonal systems
;
orthogonal decompositions
刊名:Positivity
出版年:2007
6.
The Extreme Points of Subsets of s-Concave Probabilities and a Geometric Localization Theorem
作者:
Matthieu Fradelizi and
Olivier
Guédon
刊名:Discrete and Computational Geometry
出版年:2004
7.
Supremum of a Process in Terms of Trees
作者:
Olivier
Guédon
;
Artem Zvavitch
刊名:Lecture Notes in Mathematics
出版年:2003
8.
Gaussian Version of a Theorem of Milman and Schechtman
作者:
Olivier
Guédon
关键词:
Banach space
;
Banach
;
Mazur distance
;
Euclidean subspace
;
Gaussian processes
刊名:Positivity
出版年:1997
1
按检索点细分(8)
作者(8)
按出版年细分(8)
2017年(1)
2016年(2)
2013年(1)
2007年(1)
2004年(1)
2003年(1)
2000年及以前(1)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.