A Branch and Bound Algorithm for Computing k-Nearest Neighbors (Q4065065)

From MaRDI portal
Revision as of 09:20, 24 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
scientific article

    Statements

    A Branch and Bound Algorithm for Computing k-Nearest Neighbors (English)
    0 references
    1975
    0 references

    Identifiers