Skip to content
conftrace_

Mathematics & Optimization

19,283 papers (0 classified directly here)

1
24
182
599
1,739
1,785
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

An Optimal Private Stochastic-MAB Algorithm based on Optimal Private Stopping Rule ICML 2019 An Ordinal Banzhaf Index for Social Ranking IJCAI 2019 Answer Set Programming for Judgment Aggregation IJCAI 2019 Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior IJCAI 2019 Anytime Online-to-Batch, Optimism and Acceleration ICML 2019 Anytime Recursive Best-First Search for Bounding Marginal MAP AAAI 2019 A Parameterized Perspective on Protecting Elections IJCAI 2019 A Path Signature Approach for Speech Emotion Recognition Interspeech 2019 A Persistent Weisfeiler-Lehman Procedure for Graph Classification ICML 2019 A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families NeurIPS 2019 A Polynomial Time MCMC Method for Sampling from Continuous Determinantal Point Processes ICML 2019 A Polynomial-time Solution for Robust Registration with Extreme Outlier Rates RSS 2019 A Powerful Global Test Statistic for Functional Statistical Inference AAAI 2019 Approval-Based Elections and Distortion of Voting Rules IJCAI 2019 Approximate Inference of Outcomes in Probabilistic Elections AAAI 2019 Approximate Kernel Selection with Strong Approximate Consistency AAAI 2019 Approximate Optimal Transport for Continuous Densities with Copulas IJCAI 2019 Approximate Profile Maximum Likelihood JMLR 2019 Approximate Relative Value Learning for Average-reward Continuous State MDPs UAI 2019 Approximating Orthogonal Matrices with Effective Givens Factorization ICML 2019 Approximating the Permanent by Sampling from Adaptive Partitions NeurIPS 2019 Approximation Algorithms for Stochastic Clustering JMLR 2019 Approximation and Hardness of Shift-Bribery AAAI 2019 Approximation Hardness for A Class of Sparse Optimization Problems JMLR 2019 A Practical Semi-Parametric Contextual Bandit IJCAI 2019