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 401–500 of 1,008
Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination
Li, C., Zhang, M., Andersen, D. G., & He, Y. (2020) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3318464.3380600 · Cited by 107
Distributed representations of tuples for entity resolution
Ebraheem, M., Thirumuruganathan, S., Joty, S., Ouzzani, M., & Tang, N. (2018) · Proceedings of the VLDB Endowment · doi:10.14778/3236187.3269461 · Cited by 93
Gao, J., & Long, C. (2024) · Proceedings of the ACM on Management of Data · doi:10.1145/3654970 · Cited by 90
Khan, M. M. R., Arif, R. B., Siddique, M. A. B., & Oishe, M. R. (2018) · International Conference on Electrical Engineering and Information Communication Technology · doi:10.1109/ceeict.2018.8628041 · Cited by 95
LSHiForest: A Generic Framework for Fast Tree Isolation Based Ensemble Anomaly Analysis
Zhang, X., Dou, W., He, Q., Zhou, R. H., Leckie, C. A., Ramamohanarao, K., & Salcic, Z. A. (2017) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2017.145 · Cited by 89
Polylogarithmic Private Approximations and Efficient Matching
Indyk, P., & Woodruff, D. P. (2006) · Lecture notes in computer science · doi:10.1007/11681878_13 · Cited by 89
Self-citationPath-quality monitoring in the presence of adversaries
Goldberg, S., Xiao, D., Tromer, E., Barak, B., & Rexford, J. (2008) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/1375457.1375480 · Cited by 88
Theory and applications of b -bit minwise hashing
Li, P., & König, A. C. (2011) · Communications of the ACM · doi:10.1145/1978542.1978566 · Cited by 88
Efficient nearest neighbor searching for motion planning
Atramentov, A., & LaValle, S. M. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2002.1013429 · Cited by 88
An algorithmic theory of learning: robust concepts and random projection
Arriaga, R. I., & Vempala, S. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sffcs.1999.814637 · Cited by 92
Approximate nearest neighbor algorithms for Frechet distance via product metrics
Indyk, P. (2002) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/513400.513414 · Cited by 87
Self-citationTwitter event detection: combining wavelet analysis and topic inference summarization
Cordeiro, M. M. F., & Frías, R. (2011) · Cited by 87
Query-Adaptive Reciprocal Hash Tables for Nearest Neighbor Search
Liu, X., Deng, C. D., Lang, B., Tao, D., & Li, X. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2505180 · Cited by 87
Adaptive hash retrieval with kernel based similarity
Bai, X. P., Yan, C., Yang, H., Bai, L., Zhou, J. W., & Hancock, E. R. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2017.03.020 · Cited by 87
Random Feature Maps for Dot Product Kernels
Kar, P., & Karnick, H. (2012) · Cited by 87
Planar Earthmover Is Not in $L_1$
Naor, A., & Schechtman, G. (2007) · SIAM Journal on Computing · doi:10.1137/05064206x · Cited by 87
Toussaint, G. (2005) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195905001622 · Cited by 88
Sparse projections for high-dimensional binary codes
Xia, Y., He, K., Kohli, P., & Sun, J. Z. (2015) · 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.2015.7298954 · Cited by 86
Human-in-the-loop data integration
Li, G. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3137765.3137833 · Cited by 88
Analysis of Minimum Distances in High-Dimensional Musical Spaces
Casey, M. A., Rhodes, C., & Slaney, M. (2008) · IEEE Transactions on Audio Speech and Language Processing · doi:10.1109/tasl.2008.925883 · Cited by 85
An Imbalanced Big Data Mining Framework for Improving Optimization Algorithms Performance
Hassib, E. M., El-Desouky, A. I., El‐kenawy, E. M., & Elghamrawy, S. M. (2019) · IEEE Access · doi:10.1109/access.2019.2955983 · Cited by 85
Molecular-level similarity search brings computing to DNA data storage
Bee, C., Chen, Y.-J., Queen, M., Ward, D., Liu, X., Organick, L., Seelig, G., Strauß, K., & Ceze, L. (2021) · Nature Communications · doi:10.1038/s41467-021-24991-z · Cited by 87
Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters
Gollapudi, S., Karia, N., Sivashankar, V., Krishnaswamy, R., Begwani, N., Raz, S., Lin, Y., Zhang, Y., Mahapatro, N., Srinivasan, P., et al. (2023) · International World Wide Web Conference (WWW) · doi:10.1145/3543507.3583552 · Cited by 85
Approximate nearest neighbors and sequence comparison with block operations
Muthukrishnan, S., & Şahinalp, S. C. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335353 · Cited by 85
Robust content-based image searches for copyright protection
Berrani, S.-A., Amsaleg, L., & Gros, P. (2003) · ACM International Workshop On Multimedia Databases · doi:10.1145/951676.951690 · Cited by 85
The string edit distance matching problem with moves
Cormode, G., & Muthukrishnan, S. (2002) · Symposium on Discrete Algorithms · doi:10.5555/545381.545470 · Cited by 85
Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search
Shrivastava, A., & Li, P. (2014) · Cited by 84
Hierarchical Clustering-Based Graphs for Large Scale Approximate Nearest Neighbor Search
Muñoz, J. A. V., Gonçalves, M. A., Dias, Z., & Torres, R. D. S. (2019) · Pattern Recognition · doi:10.1016/j.patcog.2019.106970 · Cited by 84
Echihabi, K., Zoumpatianos, K., Palpanas, T., & Benbrahim, H. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3368289.3368303 · Cited by 84
Tracking Web spam with HTML style similarities
Urvoy, T., Chauveau, E., Filoche, P., & Lavergne, T. (2008) · ACM Transactions on the Web · doi:10.1145/1326561.1326564 · Cited by 84
Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation
Tropp, J. A., Yurtsever, A., Udell, M. R., & Cevher, V. (2019) · SIAM Journal on Scientific Computing · doi:10.1137/18m1201068 · Cited by 83
Deformable spanners and applications
Gao, J., Guibas, L. J., & Nguyen, T. A. (2005) · Computational Geometry · doi:10.1016/j.comgeo.2005.10.001 · Cited by 83
Efficient retrieval of recommendations in a matrix factorization framework
Koenigstein, N., Ram, P., & Shavitt, Y. (2012) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2396761.2396831 · Cited by 82
Scalable distributed event detection for Twitter
McCreadie, R., Macdonald, C., Ounis, I., Osborne, M., & Petrović, S. (2013) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2013.6691620 · Cited by 82
(2024) · ACM eBooks · doi:10.1145/3674127 · Cited by 86
An efficient partition based method for exact set similarity joins
Deng, D., Li, G., Wen, H., & Feng, J. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2856318.2856330 · Cited by 81
A random forest model for basal area increment predictions from national forest inventory data
Jevšenak, J., & Skudnik, M. (2020) · Forest Ecology and Management · doi:10.1016/j.foreco.2020.118601 · Cited by 83
Low distortion embeddings for edit distance
Ostrovsky, R., & Rabani, Y. (2007) · Journal of the ACM · doi:10.1145/1284320.1284322 · Cited by 81
Efficiently Computing the Robinson-Foulds Metric
Pattengale, N. D., Gottlieb, E. J., & Moret, B. M. E. (2007) · Journal of Computational Biology · doi:10.1089/cmb.2007.r012 · Cited by 81
Partitioning Well-Clustered Graphs: Spectral Clustering Works!
Peng, R., Sun, H., & Zanetti, L. (2017) · SIAM Journal on Computing · doi:10.1137/15m1047209 · Cited by 80
Asymmetric Minwise Hashing for Indexing Binary Inner Products and Set Containment
Shrivastava, A., & Li, P. (2015) · International World Wide Web Conference (WWW) · doi:10.1145/2736277.2741285 · Cited by 80
Cluster-discovery of Twitter messages for event detection and trending
Kaleel, S. B., & Abhari, A. (2014) · Journal of Computational Science · doi:10.1016/j.jocs.2014.11.004 · Cited by 80
Compressed Fingerprint Matching and Camera Identification via Random Projections
Valsesia, D., Coluccia, G., Bianchi, T., & Magli, E. (2015) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2415461 · Cited by 80
Eppstein, D., Goodrich, M. T., Uyeda, F., & Varghese, G. (2011) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2043164.2018462 · Cited by 80
Approximate Nearest Neighbor Queries Revisited
Chan, T. M. (1998) · Discrete & Computational Geometry · doi:10.1007/pl00009390 · Cited by 80
Schwab, P., Linhardt, L., & Karlen, W. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.00656 · Cited by 117
On Symmetric and Asymmetric LSHs for Inner Product SearchPreprint
Neyshabur, B., & Srebro, N. (2015) · Cited by 80
Weakly Supervised Multimodal Hashing for Scalable Social Image Retrieval
Tang, J., & Li, Z. (2017) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2017.2715227 · Cited by 79
Processing tweets for cybersecurity threat awareness
Alves, F., Bettini, A., Ferreira, P., & Bessani, A. (2020) · Information Systems · doi:10.1016/j.is.2020.101586 · Cited by 83
Searching Twitter: Separating the Tweet from the Chaff
Hurlock, J., & Wilson, M. L. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v5i1.14117 · Cited by 78
Approximate Nearest Subspace Search
Basri, R., Hassner, T., & Zelnik‐Manor, L. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.110 · Cited by 78
Earth Mover Distance over High-Dimensional Spaces
Andoni, A., Indyk, P., & Krauthgamer, R. (2007) · Cited by 78
Self-citationAn efficient indexing method for nearest neighbor searches in high-dirnensional image databases
Cha, G.-H., Zhu, X., Petkovic, P., & Chung, C. (2002) · IEEE Transactions on Multimedia · doi:10.1109/6046.985556 · Cited by 78
NuMax: A Convex Approach for Learning Near-Isometric Linear Embeddings
Hegde, C., Sankaranarayanan, A. C., Yin, W., & Baraniuk, R. G. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2452228 · Cited by 77
Fan, M., Guo, J., Zhu, S., Miao, S., Sun, M., & Li, P. (2019) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3292500.3330651 · Cited by 77
Algorithmic derandomization via complexity theory
Sivakumar, D. (2002) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/509907.509996 · Cited by 77
Query-Adaptive Image Search With Hash Codes
Jiang, Y., Wang, J., Xue, X., & Chang, S. (2012) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2012.2231061 · Cited by 76
Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
O’Donnell, R., Wu, Y., & Zhou, Y. (2014) · ACM Transactions on Computation Theory · doi:10.1145/2578221 · Cited by 76
Distributed Adaptive Binary Quantization for Fast Nearest Neighbor Search
Liu, X., Li, Z., Deng, C. D., & Tao, D. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2729896 · Cited by 76
Performance of a geometric deep learning pipeline for HL-LHC particle tracking
Ju, X., Murnane, D., Calafiura, P., Choma, N., Conlon, S., Farrell, S., Xu, Y., Spiropulu, M., Vlimant, J.-R., Aurisano, A., et al. (2021) · The European Physical Journal C · doi:10.1140/epjc/s10052-021-09675-8 · Cited by 115
Gao, J., & Long, C. (2023) · Proceedings of the ACM on Management of Data · doi:10.1145/3589282 · Cited by 76
Hardness of approximate nearest neighbor search
Rubinstein, A. (2018) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3188745.3188916 · Cited by 75
Self-organizing map-based approaches in DDoS flooding detection using SDN
Nam, T. M., Phong, P. H., Khoa, T. D., Hương, T. T., Nam, P. N., Thanh, N. H., Thang, L. X., Tuan, P. A., Dung, L. Q., & Lợi, V. D. (2018) · International Conference on Information Networking · doi:10.1109/icoin.2018.8343119 · Cited by 75
GraphClust: alignment-free structural clustering of local RNA secondary structures
Heyne, S., Costa, F., Rose, D., & Backofen, R. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts224 · Cited by 77
A rule dynamics approach to event detection in Twitter with its application to sports and politics
Adedoyin-Olowe, M., Gaber, M. M., Dancausa, C. M., Stahl, F. T., & Gomes, J. B. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.02.028 · Cited by 74
The Successful Delivery of Megaprojects: A Novel Research Method
Locatelli, G., Mikić, M., Kovačević, M. A., Brookes, N. J., & Ivanišević, N. (2017) · Project Management Journal · doi:10.1177/875697281704800506 · Cited by 74
Efficient distributed locality sensitive hashing
Bahmani, B., Goel, A., & Shinde, R. (2012) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2396761.2398596 · Cited by 73
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Behm, A., Ji, S., Li, C., & Lu, J. (2009) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2009.32 · Cited by 73
Adaptive near-duplicate detection via similarity learning
Hajishirzi, H., Yih, W.-T., & Kołcz, A. (2010) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1835449.1835520 · Cited by 73
Improving the efficiency of dynamic malware analysis
Bayer, U., Kirda, E., & Kruegel, C. (2010) · ACM Symposium on Applied Computing · doi:10.1145/1774088.1774484 · Cited by 73
Nearest-neighbor caching for content-match applications
Pandey, S., Broder, A., Chierichetti, F., Josifovski, V., Kumar, R., & Vassilvitskii, S. (2009) · International World Wide Web Conference (WWW) · doi:10.1145/1526709.1526769 · Cited by 73
Fast construction of nets in low dimensional metrics, and their applications
Har-Peled, S., & Mendel, M. (2005) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1064092.1064117 · Cited by 73
In Defense of MinHash Over SimHashPreprint
Shrivastava, A., & Li, P. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.4416 · Cited by 73
Zhan, J., Mao, J., Liu, Y., Guo, J., Zhang, M., & Ma, S. (2022) · Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3488560.3498443 · Cited by 72
Jiang, R., Lu, R., & Choo, K. R. (2016) · Future Generation Computer Systems · doi:10.1016/j.future.2016.05.005 · Cited by 72
Adaptive Cost-Sensitive Online Classification
Zhao, P., Zhang, Y., Wu, M., Hoi, S. C. H., Tan, M., & Huang, J. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2826011 · Cited by 72
Deep Learning based Motion Prediction for Exoskeleton Robot Control in Upper Limb Rehabilitation
Ren, J.-L., Chien, Y.-H., Chia, E.-Y., Fu, L., & Lai, J. (2019) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2019.8794187 · Cited by 72
Non-Metric Locality-Sensitive Hashing
Mu, Y., & Yan, S. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7683 · Cited by 72
A similarity-based leaf image retrieval scheme: Joining shape and venation features
Nam, Y., Hwang, E., & Kim, D.-Y. (2007) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2007.08.002 · Cited by 72
Finding Local Anomalies in Very High Dimensional Space
de Vries, T., Chawla, S., & Houle, M. E. (2010) · Proceedings · doi:10.1109/icdm.2010.151 · Cited by 76
Instance selection of linear complexity for big data
González, Á. A., Díez-Pastor, J.-F., Rodríguez, J. J., & García‐Osorio, C. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.05.056 · Cited by 72
A stratified sampling based clustering algorithm for large-scale data
Zhao, X., Liang, J., & Dang, C. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.09.007 · Cited by 75
Improved lower bounds for embeddings into L1
Krauthgamer, R., & Rabani, Y. (2006) · doi:10.5555/1109557.1109669 · Cited by 72
Leveraging category-level labels for instance-level image retrieval
Gordoa, A., Rodríguez-Serrano, J. A., Perronnin, F., & Valveny, E. (2012) · 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.2012.6248035 · Cited by 77
Segmental acoustic indexing for zero resource keyword search
Levin, K., Jansen, A., & Durme, B. V. (2015) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2015.7179089 · Cited by 70
Performance of Johnson-Lindenstrauss transform for k -means and k -medians clustering
Makarychev, K., Makarychev, Y., & Razenshteyn, I. (2019) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3313276.3316350 · Cited by 70
Face video retrieval with image query via hashing across Euclidean space and Riemannian manifold
Li, Y., Wang, R., Huang, Z., Shan, S., & Chen, X. (2015) · 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.2015.7299108 · Cited by 70
Managing massive time series streams with multi-scale compressed trickles
Reeves, G., Liu, J., Nath, S., & Zhao, F. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687639 · Cited by 70
Varga, E. D., Beretka, S. F., Noce, C., & Sapienza, G. (2014) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2014.2354552 · Cited by 70
Secure searchable encryption: a survey
Wang, Y., Wang, J., & Chen, X. (2016) · Journal of Communications and Information Networks · doi:10.1007/bf03391580 · Cited by 70
DNA Data Storage and Hybrid Molecular–Electronic Computing
Carmean, D., Ceze, L., Seelig, G., Stewart, K., Strauss, K., & Willsey, M. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2875386 · Cited by 69
Structure Sensitive Hashing With Adaptive Product Quantization
Liu, X., Du, B., Deng, C. D., Liu, M., & Lang, B. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2474742 · Cited by 69
Fighting N-day vulnerabilities with automated CVSS vector prediction at disclosure
Elbaz, C., Rilling, L., & Morin, C. A. (2020) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1145/3407023.3407038 · Cited by 69
Pruning SIFT for scalable near-duplicate image matching
Foo, J. J., & Sinha, R. (2007) · Australasian Database Conference · Cited by 69
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Kibriya, A. M., & Frank, E. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74976-9_16 · Cited by 69
Finding Correlations in Subquadratic Time, with Applications to Learning Parities and Juntas
Valiant, G. J. (2012) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2012.27 · Cited by 69
Video fingerprinting for copy identification: from research to industry applications
Lu, J. Y. (2009) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.805709 · Cited by 69
Overlapping correlation clustering
Bonchi, F., Gionis, A., & Ukkonen, A. (2012) · Knowledge and Information Systems · doi:10.1007/s10115-012-0522-9 · Cited by 69
An Analysis of Random Projection for Changeable and Privacy-Preserving Biometric Verification
Wang, Y., & Plataniotis, K. N. (2010) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2037131 · Cited by 69
Reductions Among High Dimensional Proximity Problems
Goel, A., Indyk, P., & Varadarajan, K. (2000) · Cited by 69
Self-citation
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
