Pages that link to "Item:Q1040084"
From MaRDI portal
The following pages link to New algorithms for convex cost tension problem with application to computer vision (Q1040084):
Displaying 11 items.
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
- Exact bounds for steepest descent algorithms of $L$-convex function minimization (Q1785253) (← links)
- Multi-label moves for MRFs with truncated convex priors (Q1931575) (← links)
- A spatial regularization approach for vector quantization (Q1932871) (← links)
- Robust budget allocation via continuous submodular functions (Q2019911) (← links)
- Directed discrete midpoint convexity (Q2024598) (← links)
- Dijkstra's algorithm and L-concave function maximization (Q2248748) (← links)
- Note on time bounds of two-phase algorithms for \(L\)-convex function minimization (Q2400167) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- Discrete Midpoint Convexity (Q5108259) (← links)
