The following pages link to (Q3694703):
Displaying 12 items.
- Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
- Approximate polytope ensemble for one-class classification (Q898344) (← links)
- Recognizing polygons, or how to spy (Q1104085) (← links)
- \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) (Q1201156) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- Spanning trees in multipartite geometric graphs (Q1755734) (← links)
- Incremental topological flipping works for regular triangulations (Q1908263) (← links)
- Quantum speed-up for unsupervised learning (Q1945031) (← links)
- The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
- Efficient sampling methods for discrete distributions (Q2408923) (← links)
- Fast greedy triangulation algorithms. (Q2482901) (← links)
- Ranking intervals under visibility constraints<sup>∗</sup> (Q3477956) (← links)
