Skip to content
conftrace_

Graph Theory

1,461 papers

20
60
150
109
'10
'15
'20
'25

Papers

Preferential Attachment in Graphs with Affinities AISTATS 2015 Private Graphon Estimation for Sparse Graphs NeurIPS 2015 Rapidly Mixing Gibbs Sampling for a Class of Factor Graphs Using Hierarchy Width NeurIPS 2015 Recovering Communities in the General Stochastic Block Model Without Knowing the Parameters NeurIPS 2015 Rent3D: Floor-Plan Priors for Monocular Layout Estimation CVPR 2015 Revisiting the Limits of MAP Inference by MWSS on Perfect Graphs AISTATS 2015 Robust Large Scale Monocular Visual SLAM CVPR 2015 Segregated Graphs and Marginals of Chain Graph Models NeurIPS 2015 Sparse PCA via Bipartite Matchings NeurIPS 2015 Spectral Norm Regularization of Orthonormal Representations for Graph Transduction NeurIPS 2015 Stay on path: PCA along graph paths ICML 2015 Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery COLT 2015 Subgraph Matching Using Compactness Prior for Robust Feature Correspondence CVPR 2015 Submodular Hamming Metrics NeurIPS 2015 Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's NeurIPS 2015 The Consistency of Common Neighbors for Link Prediction in Stochastic Blockmodels NeurIPS 2015 The Stitched Puppet: A Graphical Model of 3D Human Shape and Pose CVPR 2015 Tractable Bayesian Network Structure Learning with Bounded Vertex Cover Number NeurIPS 2015 Trend Filtering on Graphs AISTATS 2015 Vector-Space Markov Random Fields via Exponential Families ICML 2015 Active Learning for Undirected Graphical Model Selection AISTATS 2014 Adaptive Variable Clustering in Gaussian Graphical Models AISTATS 2014 A Junction Tree Framework for Undirected Graphical Model Selection JMLR 2014 An inclusion optimal algorithm for chain graph structure learning AISTATS 2014 Anti-differentiating approximation algorithms:A case study with min-cuts, spectral, and flow ICML 2014