The DOI matches its Crossref record; 74 of the 76 references it cites were found in a registry or an index.
Approximate nearest neighbors: towards removing the curse of dimensionality
Abstract
Article Free Access Share on Approximate nearest neighbors: towards removing the curse of dimensionality Authors: Piotr Indyk Department of Computer Science, Stanford University, Stanford, CA Department of Computer Science, Stanford University, Stanford, CAView Profile , Rajeev Motwani Department of Computer Science, Stanford University, Stanford, CA Department of Computer Science, Stanford University, Stanford, CAView Profile Authors Info & Claims STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computingMay 1998 Pages 604–613https://doi.org/10.1145/276698.276876Online:23 May 1998Publication History 2,363citation11,545DownloadsMetricsTotal Citations2,363Total Downloads11,545Last 12 Months769Last 6 weeks97 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“However, SSTH suffers from serious efficiency issue due to the involvement of de-binarization and de-LSTM.”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“Given six query videos of different topics, the proposed algorithm makes fewer mistakes in retrieving the similar videos for each query compared with SSTH.”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“SSTH [29] / / 8.21h / / 8.23h / / 8.48h / / 8.55h”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“For example, the precision@100 at 64 bits reaches 26.1% under the proposed framework and the difference over SSTH (20.4%) is 5.7%.”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“For examples, the mAP@5 values at the code length of 128 are 59.3% and 57.1% for UDVH-TSN and UDVH-LSTM on FCVID, which are at least 7% higher than that in SSTH (50.1%).”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“Moreover, the UDVH-based methods substantially yield better retrieval performance over SSTH, which is consistent with the results reported in Fig. 5 and further demonstrates the superiority of our self-taught training strategy involving clustering and balanced rotation.”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“Considering the deep architectures usually converge within t = 5 loops for the UDVH-based methods, the total training cost is less than 4.5 hours, which is much shorter than training SSTH (over 8 hours), thus indicating the high efficiency of the proposed hashing framework.”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“The most time-consuming parts of SSTH include the backpropagation of Binary LSTM units when updating their binary outputs and the complex network structures [29], which are not adopted in our algorithm.”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
In the citing paper
“Specifically, as shown in Fig. 9(a), the mAP@5 values at 128 bits on FCVID are 50.1% and 57.1% for SSTH and UDVH-LSTM, which are over 15% higher than the values achieved when using CNN features.”
From Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval (2019) · cites this paper as [29]
Citations
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,621
Rayward-Smith, V. J., Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1991) · Journal of the Operational Research Society · doi:10.2307/2583667 · Cited by 16,958
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 9,743
Analysis of a complex of statistical variables into principal components.
Hotelling, H. (1933) · Journal of Educational Psychology · doi:10.1037/h0071325 · Cited by 9,691
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,498
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,055
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,098
Self-citationPattern classification and scene analysis
Chien, Y. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100577 · Cited by 3,421
Cited by
Sorted by citations
Items 901–1,000 of 1,008
Efficient regular data structures and algorithms for location and proximity problems
Amir, A., Efrat, A., Indyk, P., & Samet, H. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sffcs.1999.814588 · Cited by 34
Self-citationCoding for Random ProjectionsPreprint
Li, P., Mitzenmacher, M., & Shrivastava, A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1308.2218 · Cited by 34
Gaussian Random Projection Based Non-invertible Cancelable Biometric Templates
Kaur, H., & Khanna, P. (2015) · Procedia Computer Science · doi:10.1016/j.procs.2015.06.077 · Cited by 33
Biometric Identification over Encrypted Data Made Feasible
Adjedj, M., Bringer, J., Chabanne, H., & Kindarji, B. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10772-6_8 · Cited by 33
Diamond Sampling for Approximate Maximum All-Pairs Dot-Product (MAD) Search
Ballard, G., Kolda, T. G., Pinar, A., & Seshadhri, C. (2015) · Proceedings · doi:10.1109/icdm.2015.46 · Cited by 34
Very sparse stable random projections for dimension reduction inlα (0 <α ≤ 2) norm
Li, P. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281241 · Cited by 33
Semisupervised Hashing via Kernel Hyperplane Learning for Scalable Image Search
Kan, M., Xu, D., Shan, S., & Chen, X. (2013) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2013.2276713 · Cited by 33
Fast Weighted Histograms for Bilateral Filtering and Nearest Neighbor Searching
He, S., Yang, Q., Lau, R. W. H., & Yang, M. (2015) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2015.2430671 · Cited by 33
Data-dependent dissimilarity measure: an effective alternative to geometric distance measures
Aryal, S., Ting, K. M., Washio, T., & Haffari, G. (2017) · Knowledge and Information Systems · doi:10.1007/s10115-017-1046-0 · Cited by 33
Interoperable RNA-Seq analysis in the cloud
Lachmann, A., Clarke, D. J. B., Torre, D., Xie, Z., & Ma’ayan, A. (2020) · Biochimica et Biophysica Acta (BBA) - Gene Regulatory Mechanisms · doi:10.1016/j.bbagrm.2020.194521 · Cited by 33
Kleinbort, M., Salzman, O., & Dan Halperin, C. (2020) · Springer proceedings in advanced robotics · doi:10.1007/978-3-030-43089-4_40 · Cited by 33
Gong, L., Wang, H., Ogihara, M., & Xu, J. J. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3397230.3397243 · Cited by 33
Weakly-Supervised Image Hashing through Masked Visual-Semantic Graph-based Reasoning
Jin, L., Li, Z., Pan, Y., & Tang, J. (2020) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/3394171.3414022 · Cited by 33
XML Structural Similarity Search Using MapReduce
Yuan, P., Sha, C., Wang, X., Yang, B., Zhou, A., & Yang, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14246-8_19 · Cited by 33
On Approximate Nearest Neighbors under l∞ Norm
Indyk, P. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2001.1781 · Cited by 33
Self-citationContinuous distributed monitoring
Cormode, G. (2011) · doi:10.1145/2031792.2031793 · Cited by 33
Wang, Z., Dong, W., Josephson, W. K., Lv, Q., Charikar, M., & Li, K. (2007) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/1254882.1254900 · Cited by 33
Hashing-based clustering in high dimensional data
Zamora, J., Mendoza, M., & Allende, H. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.06.008 · Cited by 33
MR-DIS: democratic instance selection for big data by MapReduce
González, Á. A., González-Rogel, A., Díez-Pastor, J.-F., & Nozal, C. L. (2017) · Progress in Artificial Intelligence · doi:10.1007/s13748-017-0117-5 · Cited by 33
Making Open Data Transparent: Data Discovery on Open Data.
Miller, R. J., Nargesian, F., Zhu, E., Christodoulakis, C., Pu, K. Q., & Andritsos, P. (2018) · IEEE Data(base) Engineering Bulletin · Cited by 33
Finding Closest Lattice Vectors Using Approximate Voronoi Cells
Doulgerakis, E., Laarhoven, T., & de Weger, B. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25510-7_1 · Cited by 33
The complexity of low-distortion embeddings between point sets
Papadimitriou, C. H., & Safra, M. (2005) · doi:10.5555/1070432.1070448 · Cited by 33
Content-based data leakage detection using extended fingerprintingPreprint
Shapira, Y., Shapira, B., & Shabtai, A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.2028 · Cited by 33
Kumar, M., & Singh, A. (2022) · Journal of Ambient Intelligence and Smart Environments · doi:10.3233/ais-220101 · Cited by 32
Semisupervised Discriminant Analysis for Hyperspectral Imagery With Block-Sparse Graph
Tan, K., Zhou, S., & Du, Q. (2015) · IEEE Geoscience and Remote Sensing Letters · doi:10.1109/lgrs.2015.2424963 · Cited by 32
Semi-supervised multi-graph hashing for scalable similarity search
Cheng, J., Leng, C., Li, P., Wang, M., & Lu, H. (2014) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2014.04.001 · Cited by 32
Parallel Sparse Spectral Clustering for SAR Image Segmentation
Gou, S., Xiong, Z., Zhu, H., & Yu, T. (2013) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2012.2230435 · Cited by 32
Batch-Orthogonal Locality-Sensitive Hashing for Angular Similarity
Ji, J., Yan, S., Li, J., Gao, G., Tian, Q., & Zhang, B. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2315806 · Cited by 32
Large-scale audio event discovery in one million YouTube videos
Jansen, A., Gemmeke, J. F., Ellis, D. P. W., Liu, X., Lawrence, W., & Freedman, D. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7952263 · Cited by 32
Pelka, O., Nensa, F., & Friedrich, C. M. (2018) · PLoS ONE · doi:10.1371/journal.pone.0206229 · Cited by 34
Beck, G., Duong, T., Lebbah, M., Azzag, H., & Cérin, C. (2019) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2019.07.015 · Cited by 32
A Robust Copy-Move Forgery Detection In Digital Image Forensics Using SURF
Badr, A., Youssif, A. A. A., & Wafi, M. (2020) · International Symposium on Digital Forensics and Security (ISDFS) · doi:10.1109/isdfs49300.2020.9116433 · Cited by 32
Anomaly Detection Algorithms for the Sleeping Cell Detection in LTE Networks
Chernov, S., Cochez, M., & Ristaniemi, T. (2015) · IEEE Vehicular Technology Conference · doi:10.1109/vtcspring.2015.7145707 · Cited by 32
Reordering rows for better compression
Daniel Lemire, A., Owen Kaser, B., & Gutarra, E. (2012) · ACM Transactions on Database Systems · doi:10.1145/2338626.2338633 · Cited by 32
A Pivot-Based Routine for Improved Parent-Finding in Hybrid MDS
Morrison, A., & Chalmers, M. (2004) · Information Visualization · doi:10.1057/palgrave.ivs.9500069 · Cited by 32
Mulahuwaish, A., Qolomany, B., Gyorick, K., Abdo, J. B., Aledhari, M., Qadir, J., Carley, K. M., & Al‐Fuqaha, A. (2025) · Computers in Human Behavior Reports · doi:10.1016/j.chbr.2025.100668 · Cited by 35
Efficient action recognition via local position offset of 3D skeletal body joints
Lu, G., Zhou, Y., Li, X., & Kudo, M. (2015) · Multimedia Tools and Applications · doi:10.1007/s11042-015-2448-1 · Cited by 31
Efficient image signatures and similarities using tensor products of local descriptors
Picard, D., & Gosselin, P.-H. (2013) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2013.02.004 · Cited by 34
Consistent Weighted Sampling Made More Practical
Wu, W., Li, B., Chen, L., & Zhang, C. (2017) · International World Wide Web Conference (WWW) · doi:10.1145/3038912.3052598 · Cited by 31
Dahlgaard, S., Knudsen, M. B. T., & Thorup, M. (2017) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2017.67 · Cited by 31
Improved Quantum Information Set Decoding
Kirshanova, E. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-79063-3_24 · Cited by 31
Sheth, U., Dutta, S., Chaudhari, M., Jeong, H., Yang, Y. L., Kohonen, J., Roos, T., & Grover, P. (2018) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2018.8622429 · Cited by 31
Searchable encryption: A survey on privacy‐preserving search schemes on encrypted outsourced data
Handa, R., Krishna, C. R., & Aggarwal, N. (2019) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.5201 · Cited by 31
Online Adaptive Asymmetric Active Learning With Limited Budgets
Zhang, Y., Zhao, P., Niu, S., Wu, Q., Cao, J., Huang, J., & Tan, M. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2955078 · Cited by 31
Deterministic Model Fitting by Local-Neighbor Preservation and Global-Residual Optimization
Xiao, G., Ma, J., Wang, S., & Chen, C. W. (2020) · IEEE Transactions on Image Processing · doi:10.1109/tip.2020.3023576 · Cited by 31
Li, P. (2008) · Symposium on Discrete Algorithms · Cited by 31
Cell-probe lower bounds for the partial match problem
Jayram, T. S., Khot, S., Kumar, R., & Rabani, Y. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780639 · Cited by 31
Clustering near-duplicate images in large collections
Foo, J. J., Zobel, J., & Sinha, R. (2007) · Multimedia Information Retrieval · doi:10.1145/1290082.1290089 · Cited by 31
Improved Bounds on the Dot Product under Random Projection and Random Sign Projection
Kabán, A. (2015) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2783258.2783364 · Cited by 31
Hashing tree-structured data: Methods and applications
Tatikonda, S., & Parthasarathy, S. (2010) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2010.5447882 · Cited by 31
A Binning Scheme for Fast Hard Drive Based Image Search
Fraundorfer, F., Stewénius, H., & Nistér, D. (2007) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2007.383174 · Cited by 31
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Basri, R., Hassner, T., & Zelnik‐Manor, L. (2007) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2007.383201 · Cited by 31
Maximum-likelihood approximate nearest neighbor method in real-time image recognition
Savchenko, A. (2016) · Pattern Recognition · doi:10.1016/j.patcog.2016.08.015 · Cited by 31
Privacy Preserving Nearest Neighbor Search
Shaneck, M., Kim, Y., & Kumar, V. (2009) · Springer eBooks · doi:10.1007/978-0-387-88735-7_10 · Cited by 31
The Sketching Complexity of Pattern Matching
Bar-Yossef, Z., Jayram, T. S., Krauthgamer, R., & Kumar, R. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27821-4_24 · Cited by 31
Anonymizing Unstructured DataPreprint
Motwani, R., & Nabar, S. U. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0810.5582 · Cited by 31
Self-citationGiatrakos, N., Kotidis, Y., Deligiannakis, A., Vassalos, V., & Theodoridis, Y. (2010) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1807167.1807199 · Cited by 30
b-bit minwise hashing for estimating three-way similarities
Li, P., König, A. C., & Gui, W. (2010) · Cited by 30
Streaming Analysis of Discourse Participants
Durme, B. V. (2013) · Cited by 30
Large-scale recommender system with compact latent factor model
Liu, C., & Wu, X.-W. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.08.009 · Cited by 30
Semantic-aware Query Processing for Activity Trajectories
Liu, H., Xu, J., Zheng, K., Chengfei Liu, A., Du, L., & Wu, X. (2017) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3018661.3018678 · Cited by 30
A Privacy-Preserving Multi-Keyword Ranked Search Over Encrypted Data in Hybrid Clouds
Dai, H., Ji, Y., Yang, G., Huang, H., & Yi, X. (2019) · IEEE Access · doi:10.1109/access.2019.2963096 · Cited by 30
Privacy-Preserving Image Retrieval and Sharing in Social Multimedia Applications
Zhang, Z., Zhou, F., Qin, S., Jia, Q., & Xu, Z. (2020) · IEEE Access · doi:10.1109/access.2020.2984916 · Cited by 30
Patterns of population genomic diversity in the invasive Japanese knotweed species complex
VanWallendael, A., Álvarez, M., & Franks, S. J. (2021) · American Journal of Botany · doi:10.1002/ajb2.1653 · Cited by 30
Saurav, S., Saini, R., & Singh, S. K. (2021) · IEEE Access · doi:10.1109/access.2021.3108029 · Cited by 31
Multi‐GPU algorithm for k‐nearest neighbor problem
Kato, K., & Hosino, T. (2011) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.1718 · Cited by 30
Application of Locality Sensitive Hashing to realtime loop closure detection
Shahbazi, H., & Zhang, H. (2011) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2011.6095099 · Cited by 30
Use of locality sensitive hashing (LSH) algorithm to match Web of Science and Scopus
Abdulhayoǧlu, M. A., & Thijs, B. (2017) · Scientometrics · doi:10.1007/s11192-017-2569-6 · Cited by 30
FROSH: FasteR Online Sketching Hashing.
Chen, X., King, I., & Lyu, M. R.-T. (2017) · Uncertainty in Artificial Intelligence · Cited by 30
Dimension reduction in the /spl lscr//sub 1/ norm
Charikar, M., & Sahai, A. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181979 · Cited by 30
Permutation Editing and Matching via Embeddings
Cormode, G., Muthukrishnan, S., & Şahinalp, S. C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48224-5_40 · Cited by 30
MSIDX: Multi-Sort Indexing for Efficient Content-Based Image Search and Retrieval
Tiakas, E., Rafailidis, D., Dimou, A., & Daras, P. (2013) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2013.2247989 · Cited by 29
Nonparametric link prediction in large scale dynamic networks
Sarkar, P., Chakrabarti, D., & Jordan, M. I. (2014) · Electronic Journal of Statistics · doi:10.1214/14-ejs943 · Cited by 29
Action recognition with appearance-motion features and fast search trees
Mikolajczyk, K., & Uemura, H. (2011) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2010.11.002 · Cited by 38
Discovering Similar Users on Twitter
Goel, A., Sharma, A., Wang, D., & Yin, Z. (2013) · Cited by 29
Twitter-scale New Event Detection via K-term Hashing
Wurzer, D., Lavrenko, V. P., & Osborne, M. (2015) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d15-1310 · Cited by 29
Zhong, Z., Fan, B., Ding, K., Li, H., Xiang, S., & Pan, C. (2016) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2016.2542342 · Cited by 29
A Generic Method for Accelerating LSH-Based Similarity Join Processing
Yu, C., Nutanong, S. Y., Li, H., Wang, C., & Yuan, X. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2638838 · Cited by 29
Binary Coding for Partial Action Analysis with Limited Observation Ratios
Qin, J., Liu, L., Shao, L., Ni, B., Chen, C., Shen, F., & Wang, Y. (2017) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2017.712 · Cited by 29
Nonlinear dimension reduction via outer Bi-Lipschitz extensions
Mahabadi, S., Makarychev, K., Makarychev, Y., & Razenshteyn, I. (2018) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3188745.3188828 · Cited by 29
A Content-Addressable DNA Database with Learned Sequence Encodings
Stewart, K., Chen, Y.-J., Ward, D., Liu, X., Seelig, G., Strauß, K., & Ceze, L. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-00030-1_4 · Cited by 29
Zhou, F., Wu, B., Yang, Y., Trajcevski, G., Zhang, K., & Zhong, T. (2018) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3269206.3269244 · Cited by 29
Supervised Discrete Hashing With Mutual Linear Regression
Liu, X., Nie, X., Zhou, Q., & Yin, Y. (2019) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/3343031.3351091 · Cited by 29
Radomski, N., Cadel-Six, S., Cherchame, E., Felten, A., Barbet, P., Palma, F., Mallet, L., Hello, S. L., Weill, F., Guillier, L., et al. (2019) · Frontiers in Microbiology · doi:10.3389/fmicb.2019.02413 · Cited by 32
Hash Bit Selection via Collaborative Neurodynamic Optimization With Discrete Hopfield Networks
Li, X., Wang, J., & Kwong, S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3068500 · Cited by 29
Modularity-based approach for tracking communities in dynamic social networks
Mazza, M., Cola, G., & Tesconi, M. (2023) · Knowledge-Based Systems · doi:10.1016/j.knosys.2023.111067 · Cited by 29
Cochez, M., & Mou, H. L. (2015) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2723372.2751521 · Cited by 29
Faster and simpler width-independent parallel algorithms for positive semidefinite programming
Peng, R., & Tangwongsan, K. (2012) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/2312005.2312026 · Cited by 29
Randomised Rough-Terrain Robot Motion Planning
Ettlin, A., & Bleuler, H. (2006) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2006.282390 · Cited by 29
Data-driven trajectory smoothing
Chazal, F., Chen, D., Guibas, L. J., Jiang, X., & Sommer, C. (2011) · ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS) · doi:10.1145/2093973.2094007 · Cited by 29
Combining neighborhood separable subspaces for classification via sparsity regularized optimization
Zhu, P., Hu, Q., Han, Y., Zhang, C., & Du, Y. (2016) · Information Sciences · doi:10.1016/j.ins.2016.08.004 · Cited by 29
A comprehensive empirical comparison of hubness reduction in high-dimensional spaces
Feldbauer, R., & Flexer, A. (2018) · Knowledge and Information Systems · doi:10.1007/s10115-018-1205-y · Cited by 29
Heo, J., Lin, Z., & Yoon, S. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2853161 · Cited by 29
Application Codesign of Near-Data Processing for Similarity Search
Lee, V. T., Mazumdar, A., Mundo, C. C. D., Alaghi, A., Ceze, L., & Oskin, M. (2018) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2018.00099 · Cited by 29
ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
Ertl, O. (2020) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3021176 · Cited by 29
Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring
Lei, Y., Huang, Q., Kankanhalli, M., & Tung, A. K. H. (2020) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3318464.3389778 · Cited by 29
Multidimensional adaptive sampling and reconstruction for ray tracing
Hachisuka, T., Jarosz, W., Weistroffer, R. P., Dale, K. M., Humphreys, G., Zwicker, M., & Jensen, H. W. (2008) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/1399504.1360632 · Cited by 29
Lower bounds for predecessor searching in the cell probe model
Sen, P. (2004) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2003.1214411 · Cited by 29
Time series similarity measures (tutorial PM-2)
Gunopulos, D., & Das, G. (2000) · doi:10.1145/349093.349108 · Cited by 29
A TUTORIAL OF RECENT DEVELOPMENTS IN THE SEEDING OF LOCAL ALIGNMENT
Brown, D. G., Li, M., & MA, B. (2004) · Journal of Bioinformatics and Computational Biology · doi:10.1142/s0219720004000983 · Cited by 29
Metadata
- Authors
- Indyk, P., & Motwani, R.
- Affiliations
- Stanford University (US)
- ORCID
- Indyk, Piotr
- Venue
- Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98
- Publisher
- ACM Press
- Published
- 1998
- Pages
- 604-613
- OpenAlex
- W2147717514
- Cited by
- 4,188
- References
- 76
- Citations by year
- 2026: 152 · 2025: 162 · 2024: 164 · 2023: 133 · 2022: 160 · 2021: 223 · 2020: 245 · 2019: 250 · 2018: 249 · 2017: 251 · 2016: 277 · 2015: 280 · 2014: 260 · 2013: 224 · 2012: 208
- FWCI
- 23.46
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM Symposium on Theory of Computing (STOC) (publishedVersion)
- Funders
- National Science Foundation
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
- Physical Sciences › Computer Science › Information Systems › Data Management and Algorithms
- Keywords
- approximate nearest neighbor search, curse of dimensionality, nearest neighbor search, metric spaces, metric embeddings, randomized algorithms
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
