ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1405.6231
  4. Cited By
Connection graph Laplacian methods can be made robust to noise

Connection graph Laplacian methods can be made robust to noise

23 May 2014
N. Karoui
Hau‐Tieng Wu
ArXiv (abs)PDFHTML

Papers citing "Connection graph Laplacian methods can be made robust to noise"

4 / 4 papers shown
Title
Learning Low-Dimensional Nonlinear Structures from High-Dimensional
  Noisy Data: An Integral Operator Approach
Learning Low-Dimensional Nonlinear Structures from High-Dimensional Noisy Data: An Integral Operator Approach
Xiucai Ding
Rongkai Ma
95
9
0
28 Feb 2022
On the spectral property of kernel-based sensor fusion algorithms of
  high dimensional data
On the spectral property of kernel-based sensor fusion algorithms of high dimensional data
Xiucai Ding
Hau‐Tieng Wu
46
9
0
25 Sep 2019
Efficient fetal-maternal ECG signal separation from two channel maternal
  abdominal ECG via diffusion-based channel selection
Efficient fetal-maternal ECG signal separation from two channel maternal abdominal ECG via diffusion-based channel selection
Ruilin Li
Martin G Frasch
Hau‐Tieng Wu
45
46
0
07 Feb 2017
Spectral Convergence of the connection Laplacian from random samples
Spectral Convergence of the connection Laplacian from random samples
A. Singer
Hau‐Tieng Wu
129
114
0
07 Jun 2013
1