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

From MaRDI portal
Revision as of 20:48, 14 March 2024 by Daniel (talk | contribs) (‎Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710434565540)
(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

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

    Identifiers

    zbMATH DE Number
    3481873
    0 references
    Wikidata QID
    Q56271120
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4065065&oldid=31042604"
    Powered by MediaWiki