The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Open accessAbstract
Consider a set of S of n data points in real d -dimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching, we preprocess S into a data structure, so that given any query point q ∈ R d , is the closest point of S to q can be reported quickly. Given any positive real ϵ, data point p is a (1 +ϵ)- approximate nearest neighbor of q if its distance from q is within a factor of (1 + ϵ) of the distance to the true nearest neighbor. We show that it is possible to preprocess a set of n points in R d in O(dn log n ) time and O(dn) space, so that given a query point q ∈ R d , and ϵ > 0, a (1 + ϵ)-approximate nearest neighbor of q can be computed in O ( c d , ϵ log n ) time, where c d,ϵ ≤ d ⌈1 + 6d/ϵ⌉ d is a factor depending only on dimension and ϵ. In general, we show that given an integer k ≥ 1, (1 + ϵ)-approximations to the k nearest neighbors of q can be computed in additional O(kd log n ) time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
Computational Geometry: Algorithms and Applications
de Berg, M., Cheong, O., van Kreveld, M. J., & Overmars, M. H. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,450
Computational Geometry--An Introduction.
Atallah, M. J., Preparata, F. P., & Shamos, M. I. (1986) · Mathematics of Computation · doi:10.2307/2008200 · Cited by 4,238
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
Preparata, F. P., & Shamos, M. I. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1098-6 · Cited by 3,655
Research works printed but not linked: 15
- 10.1109/DCC.1993.253111 · doi:10.1109/dcc.1993.253111
- 10.1145/220279.220296 · doi:10.1145/220279.220296
- 10.1145/129712.129766 · doi:10.1145/129712.129766
- CALLAHAN , P. B. , AND KOSARAJU , S.U. 1995 . Algorithms for dynamic closest pair and n-body potential fields . In Proceedings of the 6th Annual A CM-SIAM Symposium on Discrete Algorithms ( San Francisco, Calif., Jan. 22-24). ACM, New York , pp. 263 - 272 . CALLAHAN, P. B., AND KOSARAJU, S.U. 1995. Algorithms for dynamic closest pair and n-body potential fields. In Proceedings of the 6th Annual A CM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan. 22-24). ACM, New York, pp. 263-272.
- 10.1109/SFCS.1983.16 · doi:10.1109/sfcs.1983.16
- 10.1145/355826.355832 · doi:10.1145/355826.355832
- 10.1023/A:1022664626993 · doi:10.1023/a:1022664626993 · Paper page
- 10.1109/TIT.1985.1057040 · DOI
- FAYYAD , U. M. , PIATETSKY-SHAPIRO , G. , SMYTH , P. , AND UTHURUSAMY , R. 1996. Advances in Knowledge Discovery and Data Mining . AAAI Press/MIT Press , Cambridge, Mass . FAYYAD, U. M., PIATETSKY-SHAPIRO, G., SMYTH, P., AND UTHURUSAMY, R. 1996. Advances in Knowledge Discovery and Data Mining. AAAI Press/MIT Press, Cambridge, Mass.
- 10.1137/0214055 · doi:10.1137/0214055
- FREDERICKSON , G.N. 1993 . A data structure for dynamically maintaining rooted trees . In Proceedings of the 4th Annual A CM-SIAM Symposium on Discrete Algorithms. ACM , New York , pp. 175 - 194 . FREDERICKSON, G.N. 1993. A data structure for dynamically maintaining rooted trees. In Proceedings of the 4th Annual A CM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 175-194.
- GALPERIN , I. , AND RIVEST , R. L. 1993 . Scapegoat trees . In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms. ACM , New York , pp. 165 - 174 . GALPERIN, I., AND RIVEST, R. L. 1993. Scapegoat trees. In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 165-174.
- MOUNT , D. M. , NETANYAHU , N. , SILVERMAN , R. , AND WU , A. Y. 1995 . Chromatic nearest neighbor searching: A query sensitive approach . In Proceedings of the 7th Canadian Conference on Computer Geometry. (Quebec City, Que., Canada, Aug. 10-13) . pp. 261 - 266 . MOUNT, D. M., NETANYAHU, N., SILVERMAN, R., AND WU, A. Y. 1995. Chromatic nearest neighbor searching: A query sensitive approach. In Proceedings of the 7th Canadian Conference on Computer Geometry. (Quebec City, Que., Canada, Aug. 10-13). pp. 261-266.
- 10.1007/BF01377181 · doi:10.1007/bf01377181
- 10.5555/645481.655573 · doi:10.5555/645481.655573
Cited by
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
Content-based image retrieval at the end of the early years
Smeulders, A. W. M., Worring, M., Santini, S., Gupta, A., & Jain, R. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.895972 · Cited by 6,056
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
Self-citationSampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,275
Ridge-based vessel segmentation in color images of the retina
Staal, J., Abramoff, M. D., Niemeijer, M., Viergever, M. A., & van Ginneken, B. (2004) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2004.825627 · Cited by 4,202
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
‘Structure-from-Motion’ photogrammetry: A low-cost, effective tool for geoscience applications
Westoby, M. J., Brasington, J., Glasser, N. F., Hambrey, M. J., & Reynolds, J. M. (2012) · Geomorphology · doi:10.1016/j.geomorph.2012.08.021 · Cited by 4,044
RRT-connect: An efficient approach to single-query path planning
Kuffner, J. J., & LaValle, S. M. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844730 · Cited by 3,555
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
NUS-WIDE: a real-world web image database from National University of Singapore
Chua, T.-S., Tang, J., Hong, R., Li, H., Luo, Z., & Zheng, Y. (2009) · Proceedings of the ACM International Conference on Image and Video Retrieval · doi:10.1145/1646396.1646452 · Cited by 3,025
Object retrieval with large vocabularies and fast spatial matching
Philbin, J., Chum, O., Isard, M., Sivic, J., & Zisserman, A. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383172 · Cited by 2,929
Photo tourism: exploring photo collections in 3D
Snavely, N., Seitz, S. M., & Szeliski, R. (2006) · ACM Transactions on Graphics · doi:10.1145/1141911.1141964 · Cited by 2,866
FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
(2009) · Proceedings of the Fourth International Conference on Computer Vision Theory and Applications · doi:10.5220/0001787803310340 · Cited by 2,640
Modeling the World from Internet Photo Collections
Snavely, N., Seitz, S. M., & Szeliski, R. (2008) · International Journal of Computer Vision · doi:10.1007/s11263-007-0107-3 · Cited by 2,155
Context-Aware Saliency Detection
Goferman, S., Zelnik-Manor, L., & Tal, A. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.272 · Cited by 1,567
Hertzmann, A., Jacobs, C. E., Oliver, N., Curless, B., & Salesin, D. H. (2001) · Proceedings of the 28th annual conference on Computer graphics and interactive techniques · doi:10.1145/383259.383295 · Cited by 1,518
Retinal Imaging and Image Analysis
Abramoff, M. D., Garvin, M. K., & Sonka, M. (2010) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2010.2084567 · Cited by 1,439
Scalable Nearest Neighbor Algorithms for High Dimensional Data
Muja, M., & Lowe, D. G. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2321376 · Cited by 1,407
Chávez, E., Navarro, G., Baeza-Yates, R., & Marroquín, J. L. (2001) · ACM Computing Surveys · doi:10.1145/502807.502808 · Cited by 1,246
Comparison and evaluation of methods for liver segmentation from CT datasets
Heimann, T., van Ginneken, B., Styner, M. A., Arzhaeva, Y., Aurich, V., Bauer, C., Beck, A., Becker, C., Beichel, R., Bekes, G., et al. (2009) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2009.2013851 · Cited by 1,135
Agarwal, S., Furukawa, Y., Snavely, N., Simon, I., Curless, B., Seitz, S. M., & Szeliski, R. (2011) · Communications of the ACM · doi:10.1145/2001269.2001293 · Cited by 1,072
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
Andoni, A., & Indyk, P. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.49 · Cited by 1,067
Agarwal, S., Snavely, N., Simon, I., Seitz, S. M., & Szeliski, R. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459148 · Cited by 1,067
LOCI: fast outlier detection using the local correlation integral
Papadimitriou, S., Kitagawa, H., Gibbons, P. B., & Faloutsos, C. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/icde.2003.1260802 · Cited by 846
Shape google: Geometric words and expressions for invariant shape retrieval
Bronstein, A. M., Bronstein, M. M., Guibas, L. J., & Ovsjanikov, M. (2011) · ACM Transactions on Graphics · doi:10.1145/1899404.1899405 · Cited by 810
From Predictive to Prescriptive Analytics
Bertsimas, D., & Kallus, N. (2020) · Management Science · doi:10.1287/mnsc.2018.3253 · Cited by 784
Structure from motion photogrammetry in physical geography
Smith, M. W., Carrivick, J. L., & Quincey, D. J. (2016) · Progress in Physical Geography: Earth and Environment · doi:10.1177/0309133315615805 · Cited by 772
Weinmann, M., Jutzi, B., Hinz, S., & Mallet, C. (2015) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2015.01.016 · Cited by 709
Photo tourism: exploring photo collections in 3D
Snavely, N., Seitz, S. M., & Szeliski, R. (2006) · ACM SIGGRAPH 2006 Papers on - SIGGRAPH '06 · doi:10.1145/1179352.1141964 · Cited by 696
Prototype Selection for Nearest Neighbor Classification: Taxonomy and Empirical Study
Garcia, S., Derrac, J., Cano, J. R., & Herrera, F. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.142 · Cited by 695
4-points congruent sets for robust pairwise surface registration
Aiger, D., Mitra, N. J., & Cohen-Or, D. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360684 · Cited by 677
Scale-invariant heat kernel signatures for non-rigid shape recognition
Bronstein, M. M., & Kokkinos, I. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539838 · Cited by 686
Optimised KD-trees for fast image descriptor matching
Silpa-Anan, C., & Hartley, R. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587638 · Cited by 677
Real-time texture synthesis by patch-based sampling
Liang, L., Liu, C., Xu, Y.-Q., Guo, B., & Shum, H.-Y. (2001) · ACM Transactions on Graphics · doi:10.1145/501786.501787 · Cited by 655
Semi-supervised hashing for scalable image retrieval
Wang, J., Kumar, S., & Chang, S.-F. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539994 · Cited by 601
iDistance: An adaptive B + -tree based indexing method for nearest neighbor search
Jagadish, H. V., Ooi, B. C., Tan, K.-L., Yu, C., & Zhang, R. (2005) · ACM Transactions on Database Systems · doi:10.1145/1071610.1071612 · Cited by 595
van Ginneken, B., Stegmann, M. B., & Loog, M. (2006) · Medical Image Analysis · doi:10.1016/j.media.2005.02.002 · Cited by 539
Partial and approximate symmetry detection for 3D geometry
Mitra, N. J., Guibas, L. J., & Pauly, M. (2006) · ACM Transactions on Graphics · doi:10.1145/1141911.1141924 · Cited by 529
Active shape model segmentation with optimal features
van Ginneken, B., Frangi, A. F., Staal, J. J., ter Haar Romeny, B. M., & Viergever, M. A. (2002) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2002.803121 · Cited by 529
Automatic detection of red lesions in digital color fundus photographs
Niemeijer, M., van Ginneken, B., Staal, J., Suttorp-Schulten, M. S. A., & Abramoff, M. D. (2005) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2005.843738 · Cited by 504
Deep Multi-View Enhancement Hashing for Image Retrieval
Yan, C., Gong, B., Wei, Y., & Gao, Y. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.2975798 · Cited by 504
The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
Ailon, N., & Chazelle, B. (2009) · SIAM Journal on Computing · doi:10.1137/060673096 · Cited by 479
Fast approximate spectral clustering
Yan, D., Huang, L., & Jordan, M. I. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557118 · Cited by 474
Active learning of inverse models with intrinsically motivated goal exploration in robots
Baranes, A., & Oudeyer, P.-Y. (2013) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2012.05.008 · Cited by 455
6D SLAM—3D mapping outdoor environments
Nüchter, A., Lingemann, K., Hertzberg, J., & Surmann, H. (2007) · Journal of Field Robotics · doi:10.1002/rob.20209 · Cited by 450
Fast k nearest neighbor search using GPU
Garcia, V., Debreuve, E., & Barlaud, M. (2008) · 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops · doi:10.1109/cvprw.2008.4563100 · Cited by 447
Index-driven similarity search in metric spaces (Survey Article)
Hjaltason, G. R., & Samet, H. (2003) · ACM Transactions on Database Systems · doi:10.1145/958942.958948 · Cited by 439
The MOPED framework: Object recognition and pose estimation for manipulation
Collet, A., Martinez, M., & Srinivasa, S. S. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911401765 · Cited by 421
Golparvar-Fard, M., Bohn, J., Teizer, J., Savarese, S., & Peña-Mora, F. (2011) · Automation in Construction · doi:10.1016/j.autcon.2011.04.016 · Cited by 418
Estimating surface normals in noisy point cloud data
Mitra, N. J., & Nguyen, A. (2003) · Proceedings of the nineteenth annual symposium on Computational geometry · doi:10.1145/777792.777840 · Cited by 413
New inspirations in swarm intelligence: a survey
Parpinelli, R. S., & Lopes, H. S. (2011) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2011.038700 · Cited by 402
Data mining and machine learning in astronomy
BALL, N. M., & BRUNNER, R. J. (2010) · International Journal of Modern Physics D · doi:10.1142/s0218271810017160 · Cited by 383
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Ailon, N., & Chazelle, B. (2006) · Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/1132516.1132597 · Cited by 379
Random projection trees and low dimensional manifolds
Dasgupta, S., & Freund, Y. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374452 · Cited by 375
Two algorithms for nearest-neighbor search in high dimensions
Kleinberg, J. M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258653 · Cited by 348
A fully automatic and robust brain MRI tissue classification method
Cocosco, C. A., Zijdenbos, A. P., & Evans, A. C. (2003) · Medical Image Analysis · doi:10.1016/s1361-8415(03)00037-9 · Cited by 328
kNN-IS: An Iterative Spark-based design of the k-Nearest Neighbors classifier for big data
Maillo, J., Ramírez, S., Triguero, I., & Herrera, F. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.06.012 · Cited by 316
Geometric Approximation Algorithms
Har-Peled, S. (2011) · Mathematical Surveys and Monographs · doi:10.1090/surv/173 · Cited by 315
A Linear Time Histogram Metric for Improved SIFT Matching
Pele, O., & Werman, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88690-7_37 · Cited by 305
Modeling and Recognition of Landmark Image Collections Using Iconic Scene Graphs
Li, X., Wu, C., Zach, C., Lazebnik, S., & Frahm, J.-M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88682-2_33 · Cited by 294
4-points congruent sets for robust pairwise surface registration
Aiger, D., Mitra, N. J., & Cohen-Or, D. (2008) · ACM SIGGRAPH 2008 papers · doi:10.1145/1399504.1360684 · Cited by 285
Outdoors augmented reality on mobile phone using loxel-based visual feature organization
Takacs, G., Chandrasekhar, V., Gelfand, N., Xiong, Y., Chen, W.-C., Bismpigiannis, T., Grzeszczuk, R., Pulli, K., & Girod, B. (2008) · Proceedings of the 1st ACM international conference on Multimedia information retrieval · doi:10.1145/1460096.1460165 · Cited by 281
SVM-Based Classification of Segmented Airborne LiDAR Point Clouds in Urban Areas
Zhang, J., Lin, X., & Ning, X. (2013) · Remote Sensing · doi:10.3390/rs5083749 · Cited by 274
Supervised hashing with latent factor models
Zhang, P., Zhang, W., Li, W.-J., & Guo, M. (2014) · Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval · doi:10.1145/2600428.2609600 · Cited by 271
3D Skeletons: A State‐of‐the‐Art Report
Tagliasacchi, A., Delame, T., Spagnuolo, M., Amenta, N., & Telea, A. (2016) · Computer Graphics Forum · doi:10.1111/cgf.12865 · Cited by 264
Wang, M., Xu, X., Yue, Q., & Wang, Y. (2021) · Proceedings of the VLDB Endowment · doi:10.14778/3476249.3476255 · Cited by 264
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
Har-Peled, S., & Mendel, M. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704446281 · Cited by 263
Asymptotically optimal sampling-based kinodynamic planning
Li, Y., Littlefield, Z., & Bekris, K. E. (2016) · The International Journal of Robotics Research · doi:10.1177/0278364915614386 · Cited by 262
Registration of point cloud data from a geometric optimization perspective
Mitra, N. J., Gelfand, N., Pottmann, H., & Guibas, L. (2004) · Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing · doi:10.1145/1057432.1057435 · Cited by 262
ESTIMATING SURFACE NORMALS IN NOISY POINT CLOUD DATA
MITRA, N. J., NGUYEN, A., & GUIBAS, L. (2004) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195904001470 · Cited by 261
Efficient search for approximate nearest neighbor in high dimensional spaces
Kushilevitz, E., Ostrovsky, R., & Rabani, Y. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276877 · Cited by 259
Geometric Approximation via Coresets
Agarwal, P. K., Har-Peled, S., & Varadarajan, K. R. (2005) · Combinatorial and Computational Geometry · doi:10.1017/9781009701259.002 · Cited by 256
CHoG: Compressed histogram of gradients A low bit-rate feature descriptor
Chandrasekhar, V., Takacs, G., Chen, D., Tsai, S., Grzeszczuk, R., & Girod, B. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206733 · Cited by 254
Papalexi, E., Mimitou, E. P., Butler, A. W., Foster, S., Bracken, B., Mauck, W. M., Wessels, H.-H., Hao, Y., Yeung, B. Z., Smibert, P., et al. (2021) · Nature Genetics · doi:10.1038/s41588-021-00778-2 · Cited by 237
Sesar, B., Ivezić, Ž., Grammer, S. H., Morgan, D. P., Becker, A. C., Jurić, M., De Lee, N., Annis, J., Beers, T. C., Fan, X., et al. (2010) · The Astrophysical Journal · doi:10.1088/0004-637x/708/1/717 · Cited by 222
A survey on knowledge-oriented retrieval-augmented generation
Cheng, M., Luo, Y., Ouyang, J., Liu, Q., Liu, H., Li, L., Yu, S., Zhang, B., Cao, J., Ma, J., et al. (2025) · arXiv · doi:10.48550/arxiv.2503.10677 · Cited by 140
A Likelihood and Local Constraint Level Set Model for Liver Tumor Segmentation from CT Volumes
Li, C., Wang, X., Eberl, S., Fulham, M., Yin, Y., Chen, J., & Feng, D. D. (2013) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2013.2267212 · Cited by 139
Grauman, K., & Leibe, B. (2011) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.2200/s00332ed1v01y201103aim011 · Cited by 126
Scaling Memory-Augmented Neural Networks with Sparse Reads and Writes
Rae, J. W., Hunt, J. J., Harley, T., Danihelka, I., Senior, A., Wayne, G., Graves, A., & Lillicrap, T. P. (2016) · arXiv · doi:10.48550/arxiv.1610.09027 · Cited by 89
Approximate convex decomposition for 3D meshes with collision-aware concavity and tree search
Wei, X., Liu, M., Ling, Z., & Su, H. (2022) · ACM Transactions on Graphics · doi:10.1145/3528223.3530103 · Cited by 80
On Approximately Searching for Similar Word Embeddings
Sugawara, K., Kobayashi, H., & Iwasaki, M. (2016) · Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p16-1214 · Cited by 28
Steger, C. (2017) · Handbook of Machine and Computer Vision · doi:10.1002/9783527413409.ch9 · Cited by 6
Assembly of Protein Complexes in and on the Membrane with Predicted Spatial Arrangement Constraints
Christoffer, C., Harini, K., Archit, G., & Kihara, D. (2024) · Journal of Molecular Biology · doi:10.1016/j.jmb.2024.168486 · Cited by 4
Metadata
- Authors
- Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. Y.
- Venue
- Journal of the ACM
- Published
- 1998-11
- Volume
- 45
- Issue
- 6
- Pages
- 891-923
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2427881153
- Cited by
- 2,300
- References
- 55
- FWCI
- 37.55
- Type
- journal article
- Language
- en
- Open access
- bronze
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.