Graph Theory

Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching NeurIPS 2013 Solving the multi-way matching problem by permutation synchronization NeurIPS 2013 Stationary-Sparse Causality Network Learning JMLR 2013 Stochastic blockmodel approximation of a graphon: Theory and consistent estimation NeurIPS 2013 Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows JMLR 2013 Templateless Quasi-rigid Shape Modeling with Implicit Loop-Closure CVPR 2013 The Generalized Laplacian Distance and Its Applications for Visual Matching CVPR 2013 The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited NeurIPS 2013 Unsupervised Link Selection in Networks AISTATS 2013 Σ-Optimality for Active Learning on Gaussian Random Fields NeurIPS 2013 A Convex-Concave Relaxation Procedure Based Subgraph Matching Algorithm ACML 2012 A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation NeurIPS 2012 A Local Spectral Method for Graphs: With Applications to Improving Graph Partitions and Exploring Data Graphs Locally JMLR 2012 Bayesian nonparametric models for bipartite graphs NeurIPS 2012 Clustering Sparse Graphs NeurIPS 2012 Detecting Network Cliques with Radon Basis Pursuit AISTATS 2012 Discriminative Mixtures of Sparse Latent Fields for Risk Management AISTATS 2012 Efficiently finding optimal winding-constrained loops in the plane RSS 2012 Exact Covariance Thresholding into Connected Components for Large-Scale Graphical Lasso JMLR 2012 Fiedler Random Fields: A Large-Scale Spectral Approach to Statistical Network Modeling NeurIPS 2012 Fusion with Diffusion for Robust Visual Tracking NeurIPS 2012 Globally Optimizing Graph Partitioning Problems Using Message Passing AISTATS 2012 Graphlet decomposition of a weighted network AISTATS 2012 High-Dimensional Gaussian Graphical Model Selection: Walk Summability and Local Separation Criterion JMLR 2012 High-Dimensional Structured Feature Screening Using Binary Markov Random Fields AISTATS 2012