[PDF][PDF] Graph-based Semi-supervised Local Clustering with Few Labeled Nodes.
Local clustering aims at extracting a local structure inside a graph without the necessity of
knowing the entire graph structure. As the local structure is usually small in size compared to …
knowing the entire graph structure. As the local structure is usually small in size compared to …
Sparse solution technique in semi-supervised local clustering and high dimensional function approximation
Z Shen - 2024 - search.proquest.com
The sparse solution technique, stemming from the principles of compressive sensing, holds
myriad applications in both applied mathematics and data science. This dissertation studies …
myriad applications in both applied mathematics and data science. This dissertation studies …
The sufficient conditions for orthogonal matching pursuit to exactly reconstruct sparse polynomials
A Huang, R Feng, A Wang - Mathematics, 2022 - mdpi.com
Orthogonal matching pursuit (OMP for short) is a classical method for sparse signal recovery
in compressed sensing. In this paper, we consider the application of OMP to reconstruct …
in compressed sensing. In this paper, we consider the application of OMP to reconstruct …
The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials.
A Huang, R Feng, S Zheng - Numerical Mathematics: Theory …, 2022 - search.ebscohost.com
Orthogonal matching pursuit (OMP for short) algorithm is a popular method of sparse signal
recovery in compressed sensing. This paper applies OMP to the sparse polynomial …
recovery in compressed sensing. This paper applies OMP to the sparse polynomial …
[PDF][PDF] Curriculum Vitae of Ming-Jun Lai
MJ Lai - Math. Numer. Sinica, 1984 - math.uga.edu
[121] M.-J. Lai and P. Wenston, Bivariate spline method for numerical solution of steady state
Navier-Stokes equations over polygons in stream function formulation, in Advances in …
Navier-Stokes equations over polygons in stream function formulation, in Advances in …