Skip to main content
Nubint
エージェント
リソース
料金プラン
会社概要
JA
Home
論文レビュー
Mathematics
Mathematics 論文レビュー
Mathematics 分野の主要論文を動機・手法・結果に構造化した AI 論文レビュー一覧です。
すべて
Computer Science
Mathematics
Physics and Astronomy
Engineering
Materials Science
Chemistry
Chemical Engineering
Earth and Planetary Sciences
Environmental Science
Energy
Biochemistry, Genetics and Molecular Biology
Neuroscience
Immunology and Microbiology
Agricultural and Biological Sciences
Medicine
Pharmacology, Toxicology and Pharmaceutics
Health Professions
Economics, Econometrics and Finance
Business, Management and Accounting
Decision Sciences
Social Sciences
Psychology
Arts and Humanities
Filter
9999+ results
Perverse coherent sheaves (after Deligne)
Roman Bezrukavnikov
arXiv (Cornell University)
|
2000
|
68 citations
Piecewise-Deterministic Markov Chain Monte Carlo
Paul Vanetti, Alexandre Bouchard‐Côté, +2
arXiv (Cornell University)
|
2017
|
68 citations
Robust and Scalable Bayes via a Median of Subset Posterior Measures
Stanislav Minsker, Sanvesh Srivastava, +2
arXiv (Cornell University)
|
2017
|
68 citations
Semilinear wave equations on the Schwarzschild manifold I: Local decay estimates
Pieter Blue, Avy Soffer
ArXiv.org
|
2003
|
68 citations
Some Neutrosophic Algebraic Structures and Neutrosophic N-Algebraic Structures
W. B. Vasantha Kandasamy, Florentín Smarandache
ArXiv.org
|
2006
|
68 citations
Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem
Gonzalo E. Mena, Jonathan Niles‐Weed
arXiv (Cornell University)
|
2019
|
68 citations
Statistical estimation and testing via the sorted L1 norm
Małgorzata Bogdan, E. van den Berg, +2
arXiv (Cornell University)
|
2013
|
68 citations
The Fatou property of block spaces
Yoshihiro Sawano, Hitoshi Tanaka
arXiv (Cornell University)
|
2014
|
68 citations
The Gauss-Bonnet Theorem for the noncommutative two torus
Alain Connes, Paula Tretkoff
ArXiv.org
|
2009
|
68 citations
The logarithmic Sobolev inequality along the Ricci flow
Rugang Ye
ArXiv.org
|
2007
|
68 citations
69
70
71
72
73
