Zaloguj się

Gotowe bibliografie tematyczne / Low-Rank matrix approximation / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Low-Rank matrix approximation.

Artykuły w czasopismach na temat „Low-Rank matrix approximation”

Autor: Grafiati

Data publikacji: 7 grudnia 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Low-Rank matrix approximation”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Ting Liu, Ting Liu, Mingjian Sun Mingjian Sun, Naizhang Feng Naizhang Feng, Minghua Wang Minghua Wang, Deying Chen Deying Chen i and Yi Shen and Yi Shen. "Sparse photoacoustic microscopy based on low-rank matrix approximation". Chinese Optics Letters 14, nr 9 (2016): 091701–91705. http://dx.doi.org/10.3788/col201614.091701.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Parekh, Ankit, i Ivan W. Selesnick. "Enhanced Low-Rank Matrix Approximation". IEEE Signal Processing Letters 23, nr 4 (kwiecień 2016): 493–97. http://dx.doi.org/10.1109/lsp.2016.2535227.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Fomin, Fedor V., Petr A. Golovach i Fahad Panolan. "Parameterized low-rank binary matrix approximation". Data Mining and Knowledge Discovery 34, nr 2 (2.01.2020): 478–532. http://dx.doi.org/10.1007/s10618-019-00669-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Fomin, Fedor V., Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan i Saket Saurabh. "Approximation Schemes for Low-rank Binary Matrix Approximation Problems". ACM Transactions on Algorithms 16, nr 1 (11.01.2020): 1–39. http://dx.doi.org/10.1145/3365653.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Zhenyue Zhang i Keke Zhao. "Low-Rank Matrix Approximation with Manifold Regularization". IEEE Transactions on Pattern Analysis and Machine Intelligence 35, nr 7 (lipiec 2013): 1717–29. http://dx.doi.org/10.1109/tpami.2012.274.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Xu, An-Bao, i Dongxiu Xie. "Low-rank approximation pursuit for matrix completion". Mechanical Systems and Signal Processing 95 (październik 2017): 77–89. http://dx.doi.org/10.1016/j.ymssp.2017.03.024.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Barlow, Jesse L., i Hasan Erbay. "Modifiable low-rank approximation to a matrix". Numerical Linear Algebra with Applications 16, nr 10 (październik 2009): 833–60. http://dx.doi.org/10.1002/nla.651.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Jia, Yuheng, Hui Liu, Junhui Hou i Qingfu Zhang. "Clustering Ensemble Meets Low-rank Tensor Approximation". Proceedings of the AAAI Conference on Artificial Intelligence 35, nr 9 (18.05.2021): 7970–78. http://dx.doi.org/10.1609/aaai.v35i9.16972.

Pełny tekst źródła

Streszczenie:

This paper explores the problem of clustering ensemble, which aims to combine multiple base clusterings to produce better performance than that of the individual one. The existing clustering ensemble methods generally construct a co-association matrix, which indicates the pairwise similarity between samples, as the weighted linear combination of the connective matrices from different base clusterings, and the resulting co-association matrix is then adopted as the input of an off-the-shelf clustering algorithm, e.g., spectral clustering. However, the co-association matrix may be dominated by poor base clusterings, resulting in inferior performance. In this paper, we propose a novel low-rank tensor approximation based method to solve the problem from a global perspective. Specifically, by inspecting whether two samples are clustered to an identical cluster under different base clusterings, we derive a coherent-link matrix, which contains limited but highly reliable relationships between samples. We then stack the coherent-link matrix and the co-association matrix to form a three-dimensional tensor, the low-rankness property of which is further explored to propagate the information of the coherent-link matrix to the co-association matrix, producing a refined co-association matrix. We formulate the proposed method as a convex constrained optimization problem and solve it efficiently. Experimental results over 7 benchmark data sets show that the proposed model achieves a breakthrough in clustering performance, compared with 12 state-of-the-art methods. To the best of our knowledge, this is the first work to explore the potential of low-rank tensor on clustering ensemble, which is fundamentally different from previous approaches. Last but not least, our method only contains one parameter, which can be easily tuned.

Style APA, Harvard, Vancouver, ISO itp.

9

Tropp, Joel A., Alp Yurtsever, Madeleine Udell i Volkan Cevher. "Practical Sketching Algorithms for Low-Rank Matrix Approximation". SIAM Journal on Matrix Analysis and Applications 38, nr 4 (styczeń 2017): 1454–85. http://dx.doi.org/10.1137/17m1111590.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Liu, Huafeng, Liping Jing, Yuhua Qian i Jian Yu. "Adaptive Local Low-rank Matrix Approximation for Recommendation". ACM Transactions on Information Systems 37, nr 4 (10.12.2019): 1–34. http://dx.doi.org/10.1145/3360488.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Amini, Arash, Amin Karbasi i Farokh Marvasti. "Low-Rank Matrix Approximation Using Point-Wise Operators". IEEE Transactions on Information Theory 58, nr 1 (styczeń 2012): 302–10. http://dx.doi.org/10.1109/tit.2011.2167714.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Hou, Junhui, Lap-Pui Chau, Nadia Magnenat-Thalmann i Ying He. "Sparse Low-Rank Matrix Approximation for Data Compression". IEEE Transactions on Circuits and Systems for Video Technology 27, nr 5 (maj 2017): 1043–54. http://dx.doi.org/10.1109/tcsvt.2015.2513698.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

Zhang, Zhenyue, i Lixin Wu. "Optimal low-rank approximation to a correlation matrix". Linear Algebra and its Applications 364 (maj 2003): 161–87. http://dx.doi.org/10.1016/s0024-3795(02)00551-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Gillis, Nicolas, i Yaroslav Shitov. "Low-rank matrix approximation in the infinity norm". Linear Algebra and its Applications 581 (listopad 2019): 367–82. http://dx.doi.org/10.1016/j.laa.2019.07.017.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Song, Guang-Jing, i Michael K. Ng. "Nonnegative low rank matrix approximation for nonnegative matrices". Applied Mathematics Letters 105 (lipiec 2020): 106300. http://dx.doi.org/10.1016/j.aml.2020.106300.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

van der Veen, Alle-Jan. "A Schur Method for Low-Rank Matrix Approximation". SIAM Journal on Matrix Analysis and Applications 17, nr 1 (styczeń 1996): 139–60. http://dx.doi.org/10.1137/s0895479893261340.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Sun, Dongxia, i Lihong Zhi. "Structured Low Rank Approximation of a Bezout Matrix". Mathematics in Computer Science 1, nr 2 (5.10.2007): 427–37. http://dx.doi.org/10.1007/s11786-007-0014-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Mena, Hermann, Alexander Ostermann, Lena-Maria Pfurtscheller i Chiara Piazzola. "Numerical low-rank approximation of matrix differential equations". Journal of Computational and Applied Mathematics 340 (październik 2018): 602–14. http://dx.doi.org/10.1016/j.cam.2018.01.035.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Persson, David, i Daniel Kressner. "Randomized Low-Rank Approximation of Monotone Matrix Functions". SIAM Journal on Matrix Analysis and Applications 44, nr 2 (8.06.2023): 894–918. http://dx.doi.org/10.1137/22m1523923.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Soto-Quiros, Pablo. "Error analysis of the generalized low-rank matrix approximation". Electronic Journal of Linear Algebra 37 (23.07.2021): 544–48. http://dx.doi.org/10.13001/ela.2021.5961.

Pełny tekst źródła

Streszczenie:

In this paper, we propose an error analysis of the generalized low-rank approximation, which is a generalization of the classical approximation of a matrix $A\in\mathbb{R}^{m\times n}$ by a matrix of a rank at most $r$, where $r\leq\min\{m,n\}$.

Style APA, Harvard, Vancouver, ISO itp.

21

Zhang, Jiani, Jennifer Erway, Xiaofei Hu, Qiang Zhang i Robert Plemmons. "Randomized SVD Methods in Hyperspectral Imaging". Journal of Electrical and Computer Engineering 2012 (2012): 1–15. http://dx.doi.org/10.1155/2012/409357.

Pełny tekst źródła

Streszczenie:

We present a randomized singular value decomposition (rSVD) method for the purposes of lossless compression, reconstruction, classification, and target detection with hyperspectral (HSI) data. Recent work in low-rank matrix approximations obtained from random projections suggests that these approximations are well suited for randomized dimensionality reduction. Approximation errors for the rSVD are evaluated on HSI, and comparisons are made to deterministic techniques and as well as to other randomized low-rank matrix approximation methods involving compressive principal component analysis. Numerical tests on real HSI data suggest that the method is promising and is particularly effective for HSI data interrogation.

Style APA, Harvard, Vancouver, ISO itp.

22

Zhu, E., M. Xu i D. Pi. "A Novel Robust Principal Component Analysis Algorithm of Nonconvex Rank Approximation". Mathematical Problems in Engineering 2020 (30.09.2020): 1–17. http://dx.doi.org/10.1155/2020/9356935.

Pełny tekst źródła

Streszczenie:

Noise exhibits low rank or no sparsity in the low-rank matrix recovery, and the nuclear norm is not an accurate rank approximation of low-rank matrix. In the present study, to solve the mentioned problem, a novel nonconvex approximation function of the low-rank matrix was proposed. Subsequently, based on the nonconvex rank approximation function, a novel model of robust principal component analysis was proposed. Such model was solved with the alternating direction method, and its convergence was verified theoretically. Subsequently, the background separation experiments were performed on the Wallflower and SBMnet datasets. Furthermore, the effectiveness of the novel model was verified by numerical experiments.

Style APA, Harvard, Vancouver, ISO itp.

23

Fernández-Val, Iván, Hugo Freeman i Martin Weidner. "Low-rank approximations of nonseparable panel models". Econometrics Journal 24, nr 2 (18.03.2021): C40—C77. http://dx.doi.org/10.1093/ectj/utab007.

Pełny tekst źródła

Streszczenie:

Summary We provide estimation methods for nonseparable panel models based on low-rank factor structure approximations. The factor structures are estimated by matrix-completion methods to deal with the computational challenges of principal component analysis in the presence of missing data. We show that the resulting estimators are consistent in large panels, but suffer from approximation and shrinkage biases. We correct these biases using matching and difference-in-differences approaches. Numerical examples and an empirical application to the effect of election day registration on voter turnout in the US illustrate the properties and usefulness of our methods.

Style APA, Harvard, Vancouver, ISO itp.

24

Chen, Zhilong, Peng Wang i Detong Zhu. "Approximation Conjugate Gradient Method for Low-Rank Matrix Recovery". Symmetry 16, nr 5 (2.05.2024): 547. http://dx.doi.org/10.3390/sym16050547.

Pełny tekst źródła

Streszczenie:

Large-scale symmetric and asymmetric matrices have emerged in predicting the relationship between genes and diseases. The emergence of large-scale matrices increases the computational complexity of the problem. Therefore, using low-rank matrices instead of original symmetric and asymmetric matrices can greatly reduce computational complexity. In this paper, we propose an approximation conjugate gradient method for solving the low-rank matrix recovery problem, i.e., the low-rank matrix is obtained to replace the original symmetric and asymmetric matrices such that the approximation error is the smallest. The conjugate gradient search direction is given through matrix addition and matrix multiplication. The new conjugate gradient update parameter is given by the F-norm of matrix and the trace inner product of matrices. The conjugate gradient generated by the algorithm avoids SVD decomposition. The backtracking linear search is used so that the approximation conjugate gradient direction is computed only once, which ensures that the objective function decreases monotonically. The global convergence and local superlinear convergence of the algorithm are given. The numerical results are reported and show the effectiveness of the algorithm.

Style APA, Harvard, Vancouver, ISO itp.

25

Chang, Xiangyu, Yan Zhong, Yao Wang i Shaobo Lin. "Unified Low-Rank Matrix Estimate via Penalized Matrix Least Squares Approximation". IEEE Transactions on Neural Networks and Learning Systems 30, nr 2 (luty 2019): 474–85. http://dx.doi.org/10.1109/tnnls.2018.2844242.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Nie, Feiping, Zhanxuan Hu i Xuelong Li. "Matrix Completion Based on Non-Convex Low-Rank Approximation". IEEE Transactions on Image Processing 28, nr 5 (maj 2019): 2378–88. http://dx.doi.org/10.1109/tip.2018.2886712.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Zheng, Jianwei, Mengjie Qin, Xiaolong Zhou, Jiafa Mao i Hongchuan Yu. "Efficient Implementation of Truncated Reweighting Low-Rank Matrix Approximation". IEEE Transactions on Industrial Informatics 16, nr 1 (styczeń 2020): 488–500. http://dx.doi.org/10.1109/tii.2019.2916986.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Horasan, Fahrettin, Hasan Erbay, Fatih Varçın i Emre Deniz. "Alternate Low-Rank Matrix Approximation in Latent Semantic Analysis". Scientific Programming 2019 (3.02.2019): 1–12. http://dx.doi.org/10.1155/2019/1095643.

Pełny tekst źródła

Streszczenie:

The latent semantic analysis (LSA) is a mathematical/statistical way of discovering hidden concepts between terms and documents or within a document collection (i.e., a large corpus of text). Each document of the corpus and terms are expressed as a vector with elements corresponding to these concepts to form a term-document matrix. Then, the LSA uses a low-rank approximation to the term-document matrix in order to remove irrelevant information, to extract more important relations, and to reduce the computational time. The irrelevant information is called as “noise” and does not have a noteworthy effect on the meaning of the document collection. This is an essential step in the LSA. The singular value decomposition (SVD) has been the main tool obtaining the low-rank approximation in the LSA. Since the document collection is dynamic (i.e., the term-document matrix is subject to repeated updates), we need to renew the approximation. This can be done via recomputing the SVD or updating the SVD. However, the computational time of recomputing or updating the SVD of the term-document matrix is very high when adding new terms and/or documents to preexisting document collection. Therefore, this issue opened the door of using other matrix decompositions for the LSA as ULV- and URV-based decompositions. This study shows that the truncated ULV decomposition (TULVD) is a good alternative to the SVD in the LSA modeling.

Style APA, Harvard, Vancouver, ISO itp.

29

Pitaval, Renaud-Alexandre, Wei Dai i Olav Tirkkonen. "Convergence of Gradient Descent for Low-Rank Matrix Approximation". IEEE Transactions on Information Theory 61, nr 8 (sierpień 2015): 4451–57. http://dx.doi.org/10.1109/tit.2015.2448695.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Pei Chen. "Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm". IEEE Transactions on Signal Processing 56, nr 4 (kwiecień 2008): 1429–39. http://dx.doi.org/10.1109/tsp.2007.909353.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Duan, Xuefeng, Jiaofen Li, Qingwen Wang i Xinjun Zhang. "Low rank approximation of the symmetric positive semidefinite matrix". Journal of Computational and Applied Mathematics 260 (kwiecień 2014): 236–43. http://dx.doi.org/10.1016/j.cam.2013.09.080.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Mohd Sagheer, Sameera V., i Sudhish N. George. "Ultrasound image despeckling using low rank matrix approximation approach". Biomedical Signal Processing and Control 38 (wrzesień 2017): 236–49. http://dx.doi.org/10.1016/j.bspc.2017.06.011.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Luo, Yu, i Jie Ling. "Single-image de-raining using low-rank matrix approximation". Neural Computing and Applications 32, nr 11 (7.06.2019): 7503–14. http://dx.doi.org/10.1007/s00521-019-04271-0.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

Matveev, Sergey, i Stanislav Budzinskiy. "Sketching for a low-rank nonnegative matrix approximation: Numerical study". Russian Journal of Numerical Analysis and Mathematical Modelling 38, nr 2 (1.03.2023): 99–114. http://dx.doi.org/10.1515/rnam-2023-0009.

Pełny tekst źródła

Streszczenie:

Abstract We propose new approximate alternating projection methods, based on randomized sketching, for the low-rank nonnegative matrix approximation problem: find a low-rank approximation of a nonnegative matrix that is nonnegative, but whose factors can be arbitrary. We calculate the computational complexities of the proposed methods and evaluate their performance in numerical experiments. The comparison with the known deterministic alternating projection methods shows that the randomized approaches are faster and exhibit similar convergence properties.

Style APA, Harvard, Vancouver, ISO itp.

35

Li, Chi-Kwong, i Gilbert Strang. "An elementary proof of Mirsky's low rank approximation theorem". Electronic Journal of Linear Algebra 36, nr 36 (14.10.2020): 694–97. http://dx.doi.org/10.13001/ela.2020.5551.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

Shi, Chengfei, Zhengdong Huang, Li Wan i Tifan Xiong. "Low-Rank Tensor Completion Based on Log-Det Rank Approximation and Matrix Factorization". Journal of Scientific Computing 80, nr 3 (15.07.2019): 1888–912. http://dx.doi.org/10.1007/s10915-019-01009-x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

Lebedeva, O. S., A. I. Osinsky i S. V. Petrov. "Low-Rank Approximation Algorithms for Matrix Completion with Random Sampling". Computational Mathematics and Mathematical Physics 61, nr 5 (maj 2021): 799–815. http://dx.doi.org/10.1134/s0965542521050122.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

Huang, Zhi-Long, i Hsu-Feng Hsiao. "Inter-frame Prediction with Fast Weighted Low-rank Matrix Approximation". International Journal of Electronics and Telecommunications 59, nr 1 (1.03.2013): 9–16. http://dx.doi.org/10.2478/eletel-2013-0001.

Pełny tekst źródła

Streszczenie:

Abstract In the field of video coding, inter-frame prediction plays an important role in improving compression efficiency. The improved efficiency is achieved by finding predictors for video blocks such that the residual data can be close to zero as much as possible. For recent video coding standards, motion vectors are required for a decoder to locate the predictors during video reconstruction. Block matching algorithms are usually utilized in the stage of motion estimation to find such motion vectors. For decoder-side motion derivation, proper templates are defined and template matching algorithms are used to produce a predictor for each block such that the overhead of embedding coded motion vectors in bit-stream can be avoided. However, the conventional criteria of either block matching or template matching algorithms may lead to the generation of worse predictors. To enhance coding efficiency, a fast weighted low-rank matrix approximation approach to deriving decoder-side motion vectors for inter frame video coding is proposed in this paper. The proposed method first finds the dominating block candidates and their corresponding importance factors. Then, finding a predictor for each block is treated as a weighted low-rank matrix approximation problem, which is solved by the proposed column-repetition approach. Together with mode decision, the coder can switch to a better mode between the motion compensation by using either block matching or the proposed template matching scheme.

Style APA, Harvard, Vancouver, ISO itp.

39

Kirsteins, I. P., i D. W. Tufts. "Adaptive detection using low rank approximation to a data matrix". IEEE Transactions on Aerospace and Electronic Systems 30, nr 1 (1994): 55–67. http://dx.doi.org/10.1109/7.250406.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Xu, Fei, Jingqi Han, Yongli Wang, Ming Chen, Yongyong Chen, Guoping He i Yunhong Hu. "Dynamic Magnetic Resonance Imaging via Nonconvex Low-Rank Matrix Approximation". IEEE Access 5 (2017): 1958–66. http://dx.doi.org/10.1109/access.2017.2657645.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

Zhou, Guoxu, Andrzej Cichocki i Shengli Xie. "Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation". IEEE Transactions on Signal Processing 60, nr 6 (czerwiec 2012): 2928–40. http://dx.doi.org/10.1109/tsp.2012.2190410.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Nechepurenko, Yuri M., i Miloud Sadkane. "A Low-Rank Approximation for Computing the Matrix Exponential Norm". SIAM Journal on Matrix Analysis and Applications 32, nr 2 (kwiecień 2011): 349–63. http://dx.doi.org/10.1137/100789774.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Shen, Haipeng, i Jianhua Z. Huang. "Sparse principal component analysis via regularized low rank matrix approximation". Journal of Multivariate Analysis 99, nr 6 (lipiec 2008): 1015–34. http://dx.doi.org/10.1016/j.jmva.2007.06.007.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

Feng, Xingdong, i Xuming He. "Statistical inference based on robust low-rank data matrix approximation". Annals of Statistics 42, nr 1 (luty 2014): 190–210. http://dx.doi.org/10.1214/13-aos1186.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Gillard, J. W., i A. A. Zhigljavsky. "Stochastic algorithms for solving structured low-rank matrix approximation problems". Communications in Nonlinear Science and Numerical Simulation 21, nr 1-3 (kwiecień 2015): 70–88. http://dx.doi.org/10.1016/j.cnsns.2014.08.023.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Chang, Haixia. "Constrained Low Rank Approximation of the Hermitian Nonnegative-Definite Matrix". Advances in Linear Algebra & Matrix Theory 10, nr 02 (2020): 22–33. http://dx.doi.org/10.4236/alamt.2020.102003.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Chen, Yongyong, Yanwen Guo, Yongli Wang, Dong Wang, Chong Peng i Guoping He. "Denoising of Hyperspectral Images Using Nonconvex Low Rank Matrix Approximation". IEEE Transactions on Geoscience and Remote Sensing 55, nr 9 (wrzesień 2017): 5366–80. http://dx.doi.org/10.1109/tgrs.2017.2706326.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Inoue, Kohei, i Kiichi Urahama. "Dimensionality reduction by simultaneous low-rank approximation of matrix data". Electronics and Communications in Japan (Part II: Electronics) 90, nr 9 (2007): 42–49. http://dx.doi.org/10.1002/ecjb.20379.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Hutchings, Matthew, i Bertrand Gauthier. "Energy-Based Sequential Sampling for Low-Rank PSD-Matrix Approximation". SIAM Journal on Mathematics of Data Science 6, nr 4 (28.10.2024): 1055–77. http://dx.doi.org/10.1137/23m162449x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Brick, Yaniv, i Ali E. Yilmaz. "Rapid Rank Estimation and Low-Rank Approximation of Impedance Matrix Blocks Using Proxy Grids". IEEE Transactions on Antennas and Propagation 66, nr 10 (październik 2018): 5359–69. http://dx.doi.org/10.1109/tap.2018.2854361.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!