Co-occurring keywords · papers mentioning both
Papers
A Reduction based Method for Coloring Very Large Graphs
IJCAI 2017
A SAT Approach to Branchwidth
IJCAI 2017
Balancing information exposure in social networks
NeurIPS 2017
Parsing to 1-Endpoint-Crossing, Pagenumber-2 Graphs
ACL 2017
Scaling Active Search using Linear Similarity Functions
IJCAI 2017
Scaling Submodular Maximization via Pruned Submodularity Graphs
AISTATS 2017
Community Recovery in Graphs with Locality
ICML 2016
Enumerating Equivalence Classes of Bayesian Networks using EC Graphs
AISTATS 2016
Gemini: A Computation-Centric Distributed Graph Processing System
OSDI 2016
Real-Time Salient Object Detection With a Minimum Spanning Tree
CVPR 2016
Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts
ICCV 2015
Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's
NeurIPS 2015
Streaming, Memory Limited Algorithms for Community Detection
NeurIPS 2014
Computing the Stationary Distribution Locally
NeurIPS 2013
Efficient Computation of Shortest Path-Concavity for 3D Meshes
CVPR 2013
Joint Geodesic Upsampling of Depth Images
CVPR 2013
Online Similarity Prediction of Networked Data from Known and Unknown Graphs
COLT 2013
Why Steiner-tree type algorithms work for community detection
AISTATS 2013
A Linear Time Active Learning Algorithm for Link Classification
NeurIPS 2012
Quilting Stochastic Kronecker Product Graphs to Generate Multiplicative Attribute Graphs
AISTATS 2012
Fast b-matching via Sufficient Selection Belief Propagation
AISTATS 2011
Maximal Cliques that Satisfy Hard Constraints with Application to Deformable Object Model Learning
NeurIPS 2011
Reconstructing Patterns of Information Diffusion from Incomplete Observations
NeurIPS 2011
A Fast Traversal Heuristic and Optimal Algorithm for Effective Environmental Coverage
RSS 2010
Segmentation as Maximum-Weight Independent Set
NeurIPS 2010