Institution
National Research University – Higher School of Economics
Education•Moscow, Russia•
About: National Research University – Higher School of Economics is a education organization based out in Moscow, Russia. It is known for research contribution in the topics: Population & Computer science. The organization has 12873 authors who have published 23376 publications receiving 256396 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this paper, the effect on return on investment (ROI) of the use of social media networks (SMNs) as external drivers for supporting internal innovation search processes is investigated.
122 citations
01 Jan 2019
121 citations
••
TL;DR: In this paper, the Coulomb branches of unframed and framed quiver gauge theories of type $ADE were studied and shown to be isomorphic to the moduli space of based rational maps from the flag variety.
Abstract: This is a companion paper of arXiv:1601.03586. We study Coulomb branches of unframed and framed quiver gauge theories of type $ADE$. In the unframed case they are isomorphic to the moduli space of based rational maps from ${\\mathbb C}P^1$ to the flag variety. In the framed case they are slices in the affine Grassmannian and their generalization. In the appendix, written jointly with Joel Kamnitzer, Ryosuke Kodera, Ben Webster, and Alex Weekes, we identify the quantized Coulomb branch with the truncated shifted Yangian.
120 citations
••
TL;DR: This paper explored the effect of diverse firm resources and competences such as founders' human capital, workforce human capital and acquisition of knowledge from external sources on the innovation performance of young firms.
120 citations
•
03 Jul 2018TL;DR: In this article, two algorithms for approximating the general optimal transport (OT) distance between two discrete distributions of size n, up to accuracy δ(n 2 ) were presented.
Abstract: We analyze two algorithms for approximating the general optimal transport (OT) distance between two discrete distributions of size $n$, up to accuracy $\varepsilon$. For the first algorithm, which is based on the celebrated Sinkhorn's algorithm, we prove the complexity bound $\widetilde{O}\left({n^2/\varepsilon^2}\right)$ arithmetic operations. For the second one, which is based on our novel Adaptive Primal-Dual Accelerated Gradient Descent (APDAGD) algorithm, we prove the complexity bound $\widetilde{O}\left(\min\left\{n^{9/4}/\varepsilon, n^{2}/\varepsilon^2 \right\}\right)$ arithmetic operations. Both bounds have better dependence on $\varepsilon$ than the state-of-the-art result given by $\widetilde{O}\left({n^2/\varepsilon^3}\right)$. Our second algorithm not only has better dependence on $\varepsilon$ in the complexity bound, but also is not specific to entropic regularization and can solve the OT problem with different regularizers.
120 citations
Authors
Showing all 13307 results
Name | H-index | Papers | Citations |
---|---|---|---|
Rasmus Nielsen | 135 | 556 | 84898 |
Matthew Jones | 125 | 1161 | 96909 |
Fedor Ratnikov | 123 | 1104 | 67091 |
Kenneth J. Arrow | 113 | 411 | 111221 |
Wil M. P. van der Aalst | 108 | 725 | 42429 |
Peter Schmidt | 105 | 638 | 61822 |
Roel Aaij | 98 | 1071 | 44234 |
John W. Berry | 97 | 351 | 52470 |
Federico Alessio | 96 | 1054 | 42300 |
Denis Derkach | 96 | 1184 | 45772 |
Marco Adinolfi | 95 | 831 | 40777 |
Michael Alexander | 95 | 881 | 38749 |
Alexey Boldyrev | 94 | 439 | 32000 |
Shalom H. Schwartz | 94 | 220 | 67609 |
Richard Blundell | 93 | 487 | 61730 |