scientific article; zbMATH DE number 1893569

zbMATH Open1010.68706MaRDI QIDQ4801190FDOQ4801190

Authors: Songrit Maneewongvatana, David M. Mount 

Publication date: 7 April 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2153/21530172.htm

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1953148
• scientific article; zbMATH DE number 437556
• Publication:4952641
• scientific article; zbMATH DE number 437552
• scientific article; zbMATH DE number 1559575

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Cited In (16)

• Probably correct \(k\)-nearest neighbor search in high dimensions
• A practical approach to the 2D incremental nearest-point problem suitable for different point distributions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decomposable algorithms for nearest neighbor computing
• Some approaches to improve tree-based nearest neighbour search algorithms
• Title not available (Why is that?)
• Nearest-neighbor searching under uncertainty. I
• The vertex morphing method for node-based shape optimization
• Title not available (Why is that?)
• Random projection-based auxiliary information can improve tree-based nearest neighbor search
• Expected-Case Complexity of Approximate Nearest Neighbor Searching
• Randomized partition trees for nearest neighbor search
• Title not available (Why is that?)
• An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
• Analysis of an adaptive algorithm to find the two nearest neighbors

Uses Software

• ANN

This page was built for publication:

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