Efficient certifying algorithms for linear classification
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 2079347 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- A refinement of theorems of Kirchberger and Carathéodory
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Another simple proof of Kirchberger's theorem
- Approximating Nash equilibria and dense subgraphs via an approximate version of Carathéodory's theorem
- Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
- Certifying algorithms
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Contractions, removals, and certifying 3-connectivity in linear time
- Designing programs that check their work
- Dominator tree certification and divergent spanning trees
- Enumeration of Seven-Argument Threshold Functions
- Foundations of machine learning
- High-dimensional probability. An introduction with applications in data science
- Interior path following primal-dual algorithms. I: Linear programming
- Introduction to algorithms.
- Linear and Nonlinear Separation of Patterns by Linear Programming
- Obstructing Classification via Projection
- Pattern separation by convex programming
- Theorems of Carathéodory, Helly, and Tverberg without dimension
- Understanding and using linear programming
- Über Tchebychefsche Annäherungsmethoden.
- Über den Variabilitätsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen.
This page was built for publication: Efficient certifying algorithms for linear classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902199)
