SS-L1: Signal Processing for Graphs and Other Non-Euclidean Data |
Session Type: Lecture |
Time: Tuesday, March 16, 10:30 - 12:30 |
Location: Room A3 |
Session Chairs: Nadya Bliss, MIT Lincoln Laboratory and Patrick Wolfe, Harvard University |
SS-L1.1: TOWARD SIGNAL PROCESSING THEORY FOR GRAPHS AND NON-EUCLIDEAN DATA |
Benjamin A. Miller; Massachusetts Institute of Technology |
Nadya T. Bliss; Massachusetts Institute of Technology |
Patrick J. Wolfe; Harvard University |
SS-L1.2: OPTIMIZED INTRINSIC DIMENSION ESTIMATOR USING NEAREST NEIGHBOR GRAPHS |
Kumar Sricharan; University of Michigan |
Raviv Raich; Oregon State University |
Alfred Hero; University of Michigan |
SS-L1.3: SPECTRAL CLUSTERING FOR MULTICLASS ERDOS-RENYI GRAPHS |
Mohamed-Ali Belabbas; Harvard University |
SS-L1.4: FAST SIGNAL ANALYSIS AND DECOMPOSITION ON GRAPHS USING THE SPARSE MATRIX TRANSFORM |
Leonardo Bachega; Purdue University |
Guangzhi Cao; Purdue University |
Charles Bouman; Purdue University |
SS-L1.5: RANDOM ATTRIBUTED GRAPHS FOR STATISTICAL INFERENCE FROM CONTENT AND CONTEXT |
Allen Gorin; U.S. Department of Defense |
Carey Priebe; Johns Hopkins University |
John Grothendieck; BBN Technologies |
SS-L1.6: DETECTION AND SIMULATION OF SCENARIOS WITH HIDDEN MARKOV MODELS AND EVENT DEPENDENCY GRAPHS |
William Campbell; MIT Lincoln Laboratory |
Samuel Barrett; MIT Lincoln Laboratory |
Joel Acevedo-Aviles; MIT Lincoln Laboratory |
Brian Delaney; MIT Lincoln Laboratory |
Clifford Weinstein; MIT Lincoln Laboratory |