Pages that link to "Item:Q2263217"
From MaRDI portal
The following pages link to A randomized method for solving discrete ill-posed problems (Q2263217):
Displaying 15 items.
- Analytical study of error components for solving discrete ill-posed problems using random projections (Q269160) (← links)
- Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection (Q333589) (← links)
- Solution of linear ill-posed problems using random dictionaries (Q721620) (← links)
- Vector data transformation using random binary matrices (Q891113) (← links)
- Estimation of vectors similarity by their randomized binary projections (Q904438) (← links)
- Increasing the accuracy of solving discrete ill-posed problems by the random projection method (Q1711397) (← links)
- A linear system output transformation for sparse approximation (Q2103842) (← links)
- Fast similarity search for graphs by edit distance (Q2174059) (← links)
- Index structures for fast similarity search for symbol strings (Q2287426) (← links)
- Randomized core reduction for discrete ill-posed problem (Q2309262) (← links)
- Formation of similarity-reflecting binary vectors with random binary projections (Q2515348) (← links)
- Golub-Kahan vs. Monte Carlo: a comparison of bidiagonlization and a randomized SVD method for the solution of linear discrete ill-posed problems (Q2665542) (← links)
- Randomized generalized singular value decomposition (Q2667344) (← links)
- Tikhonov regularization and randomized GSVD (Q2813331) (← links)
- Randomized GCUR decompositions (Q6614936) (← links)
