conftrace_

minimum cost flow

11 papers

Explore in graph

Also known as

MCF MIN-COST

Co-occurring keywords · papers mentioning both

embedding representation (2) hash code (2) optimal transport (2) metric learning (2) cascade boosting (1) network flow model (1) text line extraction (1) multi-partite graph (1) matching recovery (1) quantizable representation (1)

Papers

Optimal Flow Transport and its Entropic Regularization: a GPU-friendly Matrix Iterative Algorithm for Flow Balance Satisfaction ICLR 2025 Matching Map Recovery with an Unknown Number of Outliers AISTATS 2023 Parsing Line Chart Images Using Linear Programming WACV 2022 A Better Algorithm for Societal Tradeoffs AAAI 2019 Balanced Clustering: A Uniform Model and Fast Algorithm IJCAI 2019 End-To-End Efficient Representation Learning via Cascading Combinatorial Optimization CVPR 2019 Neural Decipherment via Minimum-Cost Flow: From Ugaritic to Linear B ACL 2019 Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs NeurIPS 2018 Efficient end-to-end learning for quantizable representations ICML 2018 Text Flow: A Unified Text Detection System in Natural Scene Images ICCV 2015 Distance Patterns in Structural Similarity JMLR 2006