Bottom-up nearest neighbor search for R-treesMOON BAE SONG; KWANG JIN PARK; KONG, Ki-Sik et al.Information processing letters. 2007, Vol 101, Num 2, pp 78-85, issn 0020-0190, 8 p.Article

Fast nearest-neighbor search in dissimilarity spacesFARAGO, A; LINDER, T; LUGOSI, G et al.IEEE transactions on pattern analysis and machine intelligence. 1993, Vol 15, Num 9, pp 957-962, issn 0162-8828Article

A hashing-oriented nearest neighbor searching schemeCHIN-CHEN CHANG; TZONG-CHEN WU.Pattern recognition letters. 1993, Vol 14, Num 8, pp 625-630, issn 0167-8655Article

Range nearest-neighbor queryHAIBO HU; DIK LUN LEE.IEEE transactions on knowledge and data engineering. 2006, Vol 18, Num 1, pp 78-91, issn 1041-4347, 14 p.Article

A Cell-Based Hybrid Indexing Scheme for Energy Conserving k Nearest Neighbor Search on AirIM, Seokjin; HEE YONG YOUN.IEICE transactions on communications. 2008, Vol 91, Num 11, pp 3799-3802, issn 0916-8516, 4 p.Article

Low distortion embeddings for edit distanceOSTROVSKY, Rafail; RABANI, Yuval.Journal of the Association for Computing Machinery. 2007, Vol 54, Num 5, issn 0004-5411, 23-23:16Article

PLANAR EARTHMOVER IS NOT IN L₁NAOR, Assaf; SCHECHTMAN, Gideon.SIAM journal on computing (Print). 2008, Vol 37, Num 3, pp 804-826, issn 0097-5397, 23 p.Article

Adaptively merging large-scale range data with reflectance propertiesSAGAWA, Ryusuke; NISHINO, Ko; IKEUCHI, Katsushi et al.IEEE transactions on pattern analysis and machine intelligence. 2005, Vol 27, Num 3, pp 392-405, issn 0162-8828, 14 p.Article

Quantization-Based Approximate Nearest Neighbor Search with Optimized Multiple Residual CodebooksUCHIDA, Yusuke; TAKAGI, Koichi; KAWADA, Ryoichi et al.IEICE transactions on information and systems. 2011, Vol 94, Num 7, pp 1510-1514, issn 0916-8532, 5 p.Article

Fast and exact warping of time series using adaptive segmental approximationsSHOU, Yutao; MAMOULIS, Nikos; CHEUNG, David W et al.Machine learning. 2005, Vol 58, Num 2-3, pp 231-267, issn 0885-6125, 37 p.Article

A fast k-means clustering algorithm using cluster center displacementLAI, Jim Z. C; HUANG, Tsung-Jen; LIAW, Yi-Ching et al.Pattern recognition. 2009, Vol 42, Num 11, pp 2551-2556, issn 0031-3203, 6 p.Article

One billion points in the cloud: an octree for efficient processing of 3D laser scans : Terestrial 3D ModelingELSEBERG, Jan; BORRMANN, Dorit; NÜCHTER, Andreas et al.ISPRS journal of photogrammetry and remote sensing. 2013, Vol 76, pp 76-88, issn 0924-2716, 13 p.Article

Improvement of the k-means clustering filtering algorithmLAI, Jim Z. C; LIAW, Yi-Ching.Pattern recognition. 2008, Vol 41, Num 12, pp 3677-3681, issn 0031-3203, 5 p.Article

Nearest neighbor search in metric spaces through Content-Addressable Networks : Heterogeneous and distributed IRFALCHI, Fabrizio; GENNARO, Claudio; ZEZULA, Pavel et al.Information processing & management. 2007, Vol 43, Num 3, pp 665-683, issn 0306-4573, 19 p.Article

Fast global k-means clustering using cluster membership and inequalityLAI, JimZ. C; HUANG, Tsung-Jen.Pattern recognition. 2010, Vol 43, Num 5, pp 1954-1963, issn 0031-3203, 10 p.Article

Robust and efficient image alignment based on relative gradient matchingWEI, Shou-Der; LAI, Shang-Hong.IEEE transactions on image processing. 2006, Vol 15, Num 10, pp 2936-2943, issn 1057-7149, 8 p.Article

LOWER BOUNDS ON LOCALITY SENSITIVE HASHINGMOTWAN, Rajeev; NAOR, Assaf; PANIGRAHY, Rina et al.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 4, pp 930-935, issn 0895-4801, 6 p.Article

Optimal Parameters for Locality-Sensitive HashingSLANEY, Malcolm; LIFSHITS, Yury; HE, Junfeng et al.Proceedings of the IEEE. 2012, Vol 100, Num 9, pp 2604-2623, issn 0018-9219, 20 p.Article

Fast k most similar neighbor classifier for mixed data (tree k-MSN)HERNANDEZ-RODRIGUEZ, Selene; FCO MARTINEZ- TRINIDAD, J; ARIEL CARRASCO-OCHOA, J et al.Pattern recognition. 2010, Vol 43, Num 3, pp 873-886, issn 0031-3203, 14 p.Article

Reducing non-determinism of k-NN searching in non-ordered discrete data spacesKOLBE, Dashiell; QIANG ZHU; PRAMANIK, Sakti et al.Information processing letters. 2010, Vol 110, Num 10, pp 420-423, issn 0020-0190, 4 p.Article

Fast construction of nets in low-dimensional metrics and their applicationsHAR-PELED, Sariel; MENDEL, Manor.SIAM journal on computing (Print). 2006, Vol 35, Num 5, pp 1148-1184, issn 0097-5397, 37 p.Article

Scalable Similarity Search With Topology Preserving HashingLEI ZHANG; YONGDONG ZHANG; XIAOGUANG GU et al.IEEE transactions on image processing. 2014, Vol 23, Num 7-8, pp 3025-3039, issn 1057-7149, 15 p.Article

A Heterogeneous High-Dimensional Approximate Nearest Neighbor AlgorithmDUBINER, Moshe.IEEE transactions on information theory. 2012, Vol 58, Num 10, pp 6646-6658, issn 0018-9448, 13 p.Article

A strong lower bound for approximate nearest neighbor searchingDING LIU.Information processing letters. 2004, Vol 92, Num 1, pp 23-29, issn 0020-0190, 7 p.Article

Grid-partition index : A hybrid method for nearest-neighbor queries in wireless location-based servicesBAIHUA ZHENG; JIANLIANG XU; LEE, Wang-Chien et al.The VLDB journal. 2006, Vol 15, Num 1, pp 21-39, issn 1066-8888, 19 p.Article