On two simple[st] learning tasks

DOI10.1007/978-3-031-92932-8_18MaRDI QIDQ6902190zbMATH OpenFDO

Authors Omrit Filtser, Kien C. Huynh, Anastasia Lemetti, Joseph S. B. Mitchell, Tatiana O. Polishchuk, Valentin Polishchuk

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92932-8_18

zbMATH Keywords

classificationclusteringcomputational geometryexact algorithmsmachine learning

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A survey on semi-supervised learning
• Algorithms and Computation
• Algorithms for weak and wide separation of sets
• An Expander-Based Approach to Geometric Optimization
• Constructing Belts in Two-Dimensional Arrangements with Applications
• Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order
• Dynamic Euclidean minimum spanning trees and extrema of binary functions
• Dynamic half-space range reporting and its applications
• Efficient algorithms for bichromatic separability
• Energy-efficient algorithms
• Euclidean minimum spanning trees and bichromatic closest pairs
• Faster Pseudopolynomial Time Algorithms for Subset Sum
• Finding relevant points for nearest-neighbor classification
• Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
• How to solve it. A new aspect of mathematical method. With a foreword by John H. Conway
• scientific article; zbMATH DE number 437554 (Why is no real title available?)
• scientific article; zbMATH DE number 5504153 (Why is no real title available?)
• scientific article; zbMATH DE number 5506228 (Why is no real title available?)
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1027768 (Why is no real title available?)
• scientific article; zbMATH DE number 1034105 (Why is no real title available?)
• scientific article; zbMATH DE number 1149428 (Why is no real title available?)
• scientific article; zbMATH DE number 1436136 (Why is no real title available?)
• scientific article; zbMATH DE number 7788577 (Why is no real title available?)
• Improved bounds for planar k-sets and related problems
• Integer Programming with a Fixed Number of Variables
• L-infinity interdistance selection by parametric search
• Linear Programming in Linear Time When the Dimension Is Fixed
• Minimizing the error of linear separators on linearly inseparable data
• Orthogonal range searching on the RAM, revisited
• Predecessor on the Ultra-Wide Word RAM
• Stable snap rounding
• Support-vector networks
• Unit-disk range searching and applications

This page was built for publication: On two simple[st] learning tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902190)