受强制性开放获取政策约束的文章 - Stefan Steinerberger了解详情
无法在其他位置公开访问的文章：6 篇
Extremal uniform distribution and random chord lengths
S Steinerberger
Acta Mathematica Hungarica 130, 321-339, 2011
强制性开放获取政策： Austrian Science Fund
A new lower bound for the geometric traveling salesman problem in terms of discrepancy
S Steinerberger
Operations research letters 38 (4), 318-319, 2010
强制性开放获取政策： Austrian Science Fund
Dimensionality reduction via dynamical systems: the case of t-SNE
GC Linderman, S Steinerberger
SIAM Review 64 (1), 153-178, 2022
强制性开放获取政策： US National Science Foundation
Random restricted matching and lower bounds for combinatorial optimization
S Steinerberger
Journal of combinatorial optimization 24 (3), 280-298, 2012
强制性开放获取政策： Austrian Science Fund
The best way to reconcile your past is exponentially
S Steinerberger
The American Mathematical Monthly 127 (1), 64-69, 2020
强制性开放获取政策： US National Science Foundation
On the optimal interpoint distance sum inequality.
S Steinerberger
Archiv der Mathematik 97 (3), 2011
强制性开放获取政策： Austrian Science Fund
可在其他位置公开访问的文章：98 篇
Fast interpolation-based t-SNE for improved visualization of single-cell RNA-seq data
GC Linderman, M Rachh, JG Hoskins, S Steinerberger, Y Kluger
Nature Methods 16 (3), 243, 2019
强制性开放获取政策： US National Science Foundation, US Department of Defense, US National …
Clustering with t-SNE, provably
GC Linderman, S Steinerberger
SIAM journal on mathematics of data science 1 (2), 313-332, 2019
强制性开放获取政策： US National Institutes of Health
Neural collapse under cross-entropy loss
J Lu, S Steinerberger
Applied and Computational Harmonic Analysis 59, 224-241, 2022
强制性开放获取政策： US National Science Foundation
Citation patterns in economics and beyond
M Aistleitner, J Kapeller, S Steinerberger
Science in Context 32 (4), 361-380, 2019
强制性开放获取政策： US National Science Foundation
New Bounds for the Traveling Salesman Constant
S Steinerberger
Advances in Applied Probability 47 (1), 27-36, 2015
强制性开放获取政策： German Research Foundation
Heavy-tailed kernels reveal a finer cluster structure in t-SNE visualisations
D Kobak, G Linderman, S Steinerberger, Y Kluger, P Berens
Joint European Conference on Machine Learning and Knowledge Discovery in …, 2019
强制性开放获取政策： US National Science Foundation, US National Institutes of Health, German …
Optimal Gabor frame bounds for separable lattices and estimates for Jacobi theta functions
M Faulhuber, S Steinerberger
Journal of Mathematical Analysis and Applications 445 (1), 407-422, 2017
强制性开放获取政策： Austrian Science Fund
Lower bounds on nodal sets of eigenfunctions via the heat flow
S Steinerberger
Communications in Partial Differential Equations 39 (12), 2240-2261, 2014
强制性开放获取政策： German Research Foundation
Recovering trees with convex clustering
EC Chi, S Steinerberger
SIAM Journal on Mathematics of Data Science 1 (3), 383-407, 2019
强制性开放获取政策： US National Science Foundation
A nonlocal transport equation describing roots of polynomials under differentiation
S Steinerberger
Proceedings of the American Mathematical Society 147 (11), 4733-4744, 2019
强制性开放获取政策： US National Science Foundation
Hermite polynomials, linear flows on the torus, and an uncertainty principle for roots
F Gonçalves, DO e Silva, S Steinerberger
Journal of Mathematical Analysis and Applications 451 (2), 678-711, 2017
强制性开放获取政策： German Research Foundation
Randomized Kaczmarz converges along small singular vectors
S Steinerberger
SIAM Journal on Matrix Analysis and Applications 42 (2), 608-615, 2021
强制性开放获取政策： US National Science Foundation
A weighted randomized Kaczmarz method for solving linear systems
S Steinerberger
Mathematics of Computation 90 (332), 2815-2826, 2021
强制性开放获取政策： US National Science Foundation
Numerical integration on graphs: where to sample and how to weigh
G Linderman, S Steinerberger
Mathematics of computation 89 (324), 1933-1952, 2020
强制性开放获取政策： US National Science Foundation, US National Institutes of Health
出版信息和资助信息由计算机程序自动确定