Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

Longer titles found: (1+ε)-approximate nearest neighbor search (view)

searching for Nearest neighbor search 15 found (90 total)

alternate case: nearest neighbor search

NumPy (2,460 words) [view diff] no match in snippet view article find links to article

NumPy (pronounced /ˈnʌmpaɪ/ NUM-py) is a library for the Python programming language, adding support for large, multi-dimensional arrays and matrices,
Point Cloud Library (3,258 words) [view diff] exact match in snippet view article find links to article
approximate nearest neighbor search in high dimensional spaces. In PCL, it is especially important in the kdtree module for fast k-nearest neighbor search operations
John Langford (computer scientist) (289 words) [view diff] exact match in snippet view article
Isomap embedding algorithm, CAPTCHA challenges, Cover Trees for nearest neighbor search, Contextual Bandits (which he coined) for reinforcement learning
Simple interactive object extraction (639 words) [view diff] exact match in snippet view article find links to article
Assign all image points to foreground or background by a weighted nearest neighbor search in the color signatures. Apply some standard image processing operations
Metric tree (557 words) [view diff] exact match in snippet view article find links to article
Yianilos, Peter N. (1993). "Data structures and algorithms for nearest neighbor search in general metric spaces". Proceedings of the fourth annual ACM-SIAM
IDistance (866 words) [view diff] case mismatch in snippet view article find links to article
Zhang iDistance: An Adaptive B+-tree Based Indexing Method for Nearest Neighbor Search, ACM Transactions on Data Base Systems (ACM TODS), 30, 2, 364-397
Peter E. Hart (378 words) [view diff] exact match in snippet view article find links to article
advisor and discovered & co-published a seminal paper on 1-NN nearest neighbor search. While at the SRI International Artificial Intelligence Center
Tapestry (DHT) (887 words) [view diff] exact match in snippet view article
temporary neighborhood list. The new node then performs an iterative nearest neighbor search to fill all levels in its routing table. To leave the network,
Photon mapping (1,445 words) [view diff] exact match in snippet view article find links to article
is used. The steps are: Gather the N nearest photons using the nearest neighbor search function on the photon map. Let S be the sphere that contains these
Z-order curve (2,681 words) [view diff] exact match in snippet view article find links to article
IEEE BigData 2020: pp. 351–360 STANN: A library for approximate nearest neighbor search, using Z-order curve Methods for programming bit interleaving,
B+ tree (3,401 words) [view diff] exact match in snippet view article find links to article
2005). "iDistance: An adaptive B+-tree based indexing method for nearest neighbor search". ACM Transactions on Database Systems. 30 (2): 364–397. doi:10
Bag-of-words model in computer vision (2,621 words) [view diff] exact match in snippet view article find links to article
Words model. It also contains implementations for fast approximate nearest neighbor search using randomized k-d tree, locality-sensitive hashing, and hierarchical
Graphics processing unit (8,446 words) [view diff] exact match in snippet view article find links to article
Retrieved 2008-05-01. V. Garcia and E. Debreuve and M. Barlaud. Fast k nearest neighbor search using GPU. In Proceedings of the CVPR Workshop on Computer Vision
Machine learning (15,513 words) [view diff] exact match in snippet view article find links to article
Sugiyama, M.; Luxburg, U. V.; Guyon, I. (eds.), "An algorithm for L1 nearest neighbor search via monotonic embedding" (PDF), Advances in Neural Information
General-purpose computing on graphics processing units (7,033 words) [view diff] case mismatch in snippet view article find links to article
Garcia, Vincent; Debreuve, Eric; Barlaud, Michel (2008). "Fast k Nearest Neighbor Search using GPU". arXiv:0804.1448 [cs.CV]. Cococcioni, Marco; Grasso