Co-occurring keywords · papers mentioning both
Papers
Ddo, a Generic and Efficient Framework for MDD-Based Optimization
IJCAI 2020
Globally Optimal Contrast Maximisation for Event-Based Motion Estimation
CVPR 2020
Hybrid Models for Learning to Branch
NeurIPS 2020
k-SDPP: Fixed-Size Video Summarization via Sequential Determinantal Point Processes
IJCAI 2020
Neural Network Branching for Neural Network Verification
ICLR 2020
Reinforcement Learning for Integer Programming: Learning to Cut
ICML 2020
A Generic Approach to Accelerating Belief Propagation Based Incomplete Algorithms for DCOPs via a Branch-and-Bound Technique
AAAI 2019
Anytime Recursive Best-First Search for Bounding Marginal MAP
AAAI 2019
A Privacy Preserving Collusion Secure DCOP Algorithm
IJCAI 2019
Counting the Optimal Solutions in Graphical Models
NeurIPS 2019
Exact Combinatorial Optimization with Graph Convolutional Neural Networks
NeurIPS 2019
Linearly Converging Quasi Branch and Bound Algorithms for Global Rigid Registration
ICCV 2019
Quasi-Perfect Stackelberg Equilibrium
AAAI 2019
The Alignment of the Spheres: Globally-Optimal Spherical Mixture Alignment for Camera Pose Estimation
CVPR 2019
BPGrad: Towards Global Optimality in Deep Learning via Branch and Pruning
CVPR 2018
Conflict Directed Clause Learning for Maximum Weighted Clique Problem
IJCAI 2018
Consensus Maximization for Semantic Region Correspondences
CVPR 2018
Designing the Game to Play: Optimizing Payoff Structure in Security Games
IJCAI 2018
Globally Optimal Inlier Set Maximization for Atlanta Frame Estimation
CVPR 2018
Learning to Branch
ICML 2018
A Partitioning Algorithm for Maximum Common Subgraph Problems
IJCAI 2017
Efficient Global Point Cloud Alignment Using Bayesian Nonparametric Mixtures
CVPR 2017
Estimating the size of search trees by sampling with domain knowledge
IJCAI 2017
Learning Chordal Markov Networks via Branch and Bound
NeurIPS 2017
Learning to Run Heuristics in Tree Search
IJCAI 2017