Computer Science
Numerical Example
100%
Local Minimum
60%
Rank Approximation
60%
Adjoint Source
39%
Fast Algorithm
30%
Hilbert Space
30%
Inverse Problem
30%
Approximation (Algorithm)
30%
Frequency Domain
30%
Event Identification
30%
Regularization Method
30%
Objective Function
30%
Parametrization
30%
Singular Value
30%
Regularization
30%
Frequency Component
30%
Synthetic Data
30%
Unknown Parameter
30%
Warping Function
20%
Mathematics
Green's Functions
69%
Optimal Transport
60%
Traveltime
60%
Numerical Example
55%
Factorization
50%
Matrix
45%
Local Minimum
39%
Regularization
36%
Wavefield
30%
Low-Rank Approximation
24%
Higher Dimensions
20%
Differentiation Rule
15%
Adjoints
15%
Fast Algorithm
15%
Space-Filling Curve
15%
Hilbert Space
15%
Singular Value
15%
Probability Distribution
12%
Keyphrases
Differentiable Dynamics
60%
Sliced Wasserstein Distance
30%
Entropy Regularized Optimal Transport
30%
Misfit
30%
Measurement Bases
30%
Dynamic Time Warping
30%
Cycle Skipping
30%
Multidimensional Deconvolution
30%
Low-rank Regularization
30%
Regularized Least Squares
30%
Nuclear Norm
30%
Least Squares Approach
30%
Misfit Function
18%
Argmax
15%
Dynamic Time Warping Distance
13%
Smooth Dynamics
12%
Traveltime Difference
12%
Numerical Examples
10%
