Selection in monotone matrices and computing k th nearest neighbors

DOI10.1007/3-540-58218-5_2MaRDI QIDQ5056162zbMATH OpenOpenAlexFDO

Authors Pankaj K. Agarwal, Sandeep Sen

Publication date 9 December 2022

Published in Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58218-5_2

Mathematics Subject Classification ID

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

Recommendations

• Selection in Monotone Matrices and Computingkth Nearest Neighbors
• scientific article; zbMATH DE number 742987
• On optimum choice of \(k\) in nearest neighbor classification
• Exact \(L_{\infty}\) nearest neighbor search in high dimensions
• Monotonic matrices and clique search in graphs
• A note on subset selection for matrices
• Lower bounds for high dimensional nearest neighbor search and related problems
• scientific article; zbMATH DE number 2209718
• scientific article; zbMATH DE number 3932623

Cites work

• An O(n log n) algorithm for the all-nearest-neighbors problem
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Computing the longest diagonal of a simple polygon
• Generalized Selection and Ranking: Sorted Matrices
• Geometric applications of a matrix-searching algorithm
• Good splitters for counting points in triangles
• scientific article; zbMATH DE number 437554 (Why is no real title available?)
• scientific article; zbMATH DE number 4211552 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 742987 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• Improved Algorithms for Economic Lot Size Problems
• IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS
• New upper bounds for neighbor searching
• On range searching with semialgebraic sets
• Ray Shooting and Parametric Search
• Selecting distances in the plane
• Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
• Selection and sorting in totally monotone arrays
• Time bounds for selection

Cited in

(4)

• Perspectives of Monge properties in optimization
• IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS
• scientific article; zbMATH DE number 742987 (Why is no real title available?)
• Selection in Monotone Matrices and Computingkth Nearest Neighbors

This page was built for publication: Selection in monotone matrices and computing k th nearest neighbors

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