Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Rongrong Wang

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Santhosh Karnik

> Home > Persons > Rongrong Wang

Publications

2024
[j62]
- view
  authority control:
- export record
  dblp key:
  - journals/jcam/KarnikWI24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcam/KarnikWI24
Santhosh Karnik, Rongrong Wang, Mark A. Iwen:
Neural network approximation of continuous functions in high dimensions with applications to inverse problems. J. Comput. Appl. Math. 438: 115557 (2024)
[i25]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2403-09932
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2403-09932
Cullen Haselby, Mark A. Iwen, Santhosh Karnik, Rongrong Wang:
Tensor Deli: Tensor Completion for Low CP-Rank Tensors via Random Sampling. CoRR abs/2403.09932 (2024)
2022
[i19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2208-13305
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2208-13305
Santhosh Karnik, Rongrong Wang, Mark A. Iwen:
Neural Network Approximation of Lipschitz Functions in High Dimensions with Applications to Inverse Problems. CoRR abs/2208.13305 (2022)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.