SPMuS_L2: Graph Signal Processing and Learning |
Session Type: Lecture |
Time: Wednesday, August 31, 16:10 - 17:50 |
Location: Mediterranean |
Session Chair: Geert Leus, Delft University
|
|
SPMuS_L2.1: EIGENVALUE-BASED BLOCK DIAGONAL REPRESENTATION AND APPLICATION TO $P$-NEAREST NEIGHBOR GRAPHS |
Aylin Tastan, Michael Muma, Abdelhak Zoubir, Technische Universität Darmstadt, Germany |
|
SPMuS_L2.2: DENSITY AWARE BLUE-NOISE SAMPLING ON GRAPHS |
Daniela Dapena, Gonzalo Arce, University of Delaware, United States; Daniel Lau, University of Kentucky, United States |
|
SPMuS_L2.3: VARIANCE REDUCTION IN STOCHASTIC METHODS FOR LARGE-SCALE REGULARIZED LEAST-SQUARES PROBLEMS |
Yusuf Yigit Pilavci, GIPSA Lab, France; Pierre-Olivier Amblard, Simon Barthelme, Nicolas Tremblay, CNRS, GIPSA LAB, France |
|
SPMuS_L2.4: EFFICIENT ROBUST GRAPH LEARNING BASED ON MINIMAX CONCAVE PENALTY AND Γ-CROSS ENTROPY |
Tatsuya Koyakumaru, Masahiro Yukawa, Keio University, Japan |
|
SPMuS_L2.5: NON-NEGATIVE KERNEL GRAPHS FOR TIME-VARYING SIGNALS USING VISIBILITY GRAPHS |
Ecem Bozkurt, Antonio Ortega, University of Southern California, United States |
|