Selection in Monotone Matrices and Computingkth Nearest Neighbors

DOI10.1006/JAGM.1996.0028zbMATH Open0845.68026OpenAlexW2155635545MaRDI QIDQ4881409FDOQ4881409

Authors: Pankaj K. Agarwal, Sandeep Sen 

Publication date: 15 September 1996

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1996.0028

Recommendations

• Selection in monotone matrices and computing k th nearest neighbors
• scientific article; zbMATH DE number 742987
• On optimum choice of \(k\) in nearest neighbor classification
• Monotonic matrices and clique search in graphs
• scientific article; zbMATH DE number 3932623
• A vectorized near neighbors algorithm of order N using a monotonic logical grid
• IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS
• A note on subset selection for matrices

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (6)

• Title not available (Why is that?)
• Selection in monotone matrices and computing k th nearest neighbors
• Selection in \(X+Y\) and matrices with sorted rows and columns
• IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS
• Generalized Selection and Ranking: Sorted Matrices
• Selection and sorting in totally monotone arrays

This page was built for publication: Selection in Monotone Matrices and Computingkth Nearest Neighbors

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