Skip to content
conftrace_

dynamic programming

312 papers

DP

Papers

Differentiable Dynamic Programming for Structured Prediction and Attention ICML 2018 Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games IJCAI 2018 Global Transition-based Non-projective Dependency Parsing ACL 2018 Linear-time Constituency Parsing with RNNs and Dynamic Programming ACL 2018 Neural Maximum Subgraph Parsing for Cross-Domain Semantic Dependency Analysis CoNLL 2018 Neural Syntactic Generative Models with Exact Marginalization NAACL 2018 Non-delusional Q-learning and value-iteration NeurIPS 2018 Speeding Up Neural Machine Translation Decoding by Cube Pruning EMNLP 2018 A Minimal Span-Based Neural Constituency Parser ACL 2017 Dynamic Programming Bipartite Belief Propagation For Hyper Graph Matching IJCAI 2017 Fast(er) Exact Decoding and Global Training for Transition-Based Dependency Parsing via a Minimal Feature Set EMNLP 2017 Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms ICML 2017 k-Support and Ordered Weighted Sparsity for Overlapping Groups: Hardness and Algorithms NeurIPS 2017 Learning Heuristic Search via Imitation CoRL 2017 Linear Time Computation of Moments in Sum-Product Networks NeurIPS 2017 MCMLSD: A Dynamic Programming Approach to Line Segment Detection CVPR 2017 Online Dynamic Programming NeurIPS 2017 Online Learning of Optimal Bidding Strategy in Repeated Multi-Commodity Auctions NeurIPS 2017 Recurrent Neural Aligner: An Encoder-Decoder Neural Network Model for Sequence to Sequence Mapping Interspeech 2017 Sequence Modeling via Segmentations ICML 2017 Tracking Objects with Higher Order Interactions via Delayed Column Generation AISTATS 2017 An Online Sequence-to-Sequence Model Using Partial Conditioning NeurIPS 2016 Conditional Bernoulli Mixtures for Multi-label Classification ICML 2016 Coordinating Multiple Disparity Proposals for Stereo Computation CVPR 2016 Fast Algorithms for Segmented Regression ICML 2016