The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Multidimensional binary search trees used for associative searching
Open accessAbstract
This paper develops the multidimensional binary search tree (or k -d tree, where k is the dimensionality of the search space) as a data structure for storage of information to be retrieved by associative searches. The k -d tree is defined and examples are given. It is shown to be quite efficient in its storage requirements. A significant advantage of this structure is that a single data structure can handle many types of queries very efficiently. Various utility algorithms are developed; their proven average running times in an n record file are: insertion, O (log n ); deletion of the root, O ( n ( k -1)/ k ); deletion of a random node, O (log n ); and optimization (guarantees logarithmic performance of searches), O ( n log n ). Search algorithms are given for partial match queries with t keys specified [proven maximum running time of O ( n ( k - t )/ k )] and for nearest neighbor queries [empirically observed average running time of O (log n ).] These performances far surpass the best currently known algorithms for these tasks. An algorithm is presented to handle any general intersection query. The main focus of this paper is theoretical. It is felt, however, that k -d trees could be quite useful in many applications, and examples of potential uses are given.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,320
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
Self-citationQuad trees a data structure for retrieval on composite keys
Finkel, R. A., & Bentley, J. L. (1974) · Acta Informatica · doi:10.1007/bf00288933 · Cited by 2,041
Self-citationBlum, M., Floyd, R. W., Pratt, V., Rivest, R. L., & Tarjan, R. E. (1973) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(73)80033-9 · Cited by 1,235
Vasconcelos, W. V. (1998) · Algorithms and Computation in Mathematics · doi:10.1007/978-3-642-58951-5_2 · Cited by 404
An Algroithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1976) · Cited by 9
Self-citation
Cited by
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 · doi:10.1145/602259.602266 · Cited by 6,580
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
The Earth Mover's Distance as a Metric for Image Retrieval
Rubner, Y., Tomasi, C., & Guibas, L. J. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026543900054 · Cited by 4,568
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
The global k-means clustering algorithm
Likas, A., Vlassis, N., & J. Verbeek, J. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(02)00060-2 · Cited by 3,733
(1999) · Cited by 3,186
Theoretical and Empirical Analysis of ReliefF and RReliefF
Robnik-Šikonja, M., & Kononenko, I. (2003) · Machine Learning · doi:10.1023/a:1025667309714 · Cited by 3,025
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
Self-citationDBSCAN Revisited, Revisited: Why and How You Should (Still) Use DBSCAN
Schubert, E., Sander, J., Ester, M., Kriegel, H. P., & Xu, X. (2017) · ACM Transactions on Database Systems · doi:10.1145/3068335 · Cited by 2,737
The Quadtree and Related Hierarchical Data Structures
Samet, H. (1984) · ACM Computing Surveys · doi:10.1145/356924.356930 · Cited by 2,205
A Survey of General‐Purpose Computation on Graphics Hardware
Owens, J. D., Luebke, D., Govindaraju, N., Harris, M., Krüger, J., Lefohn, A. E., & Purcell, T. J. (2007) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2007.01012.x · Cited by 2,101
DAMMIF , a program for rapid ab-initio shape determination in small-angle scattering
Franke, D., & Svergun, D. I. (2009) · Journal of Applied Crystallography · doi:10.1107/s0021889809000338 · Cited by 2,021
FAST-LIO2: Fast Direct LiDAR-Inertial Odometry
Xu, W., Cai, Y., He, D., Lin, J., & Zhang, F. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3141876 · Cited by 1,750
Graph-based approach for airborne light detection and ranging segmentation
Vilariño, D. L., Cabaleiro, J. C., Martínez, J., Rivera, F. F., & Pena, T. F. (2017) · Journal of Applied Remote Sensing · doi:10.1117/1.jrs.11.015020 · Cited by 1,721
Atkeson, C. G., Moore, A. W., & Schaal, S. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006559212014 · Cited by 1,671
EXPERT SYSTEMS WITH APPLICATIONS
(2005) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.10.010 · Cited by 1,656
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
Three-dimensional intact-tissue sequencing of single-cell transcriptional states
Wang, X., Allen, W. E., Wright, M. A., Sylwestrak, E. L., Samusik, N., Vesuna, S., Evans, K., Liu, C., Ramakrishnan, C., Liu, J., et al. (2018) · Science · doi:10.1126/science.aat5691 · Cited by 1,620
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · ACM SIGMOD Record · doi:10.1145/971697.602266 · Cited by 1,612
Towards a general-purpose foundation model for computational pathology
Chen, R. J., Ding, T., Lu, M. Y., Williamson, D. F. K., Jaume, G., Song, A. H., Chen, B., Zhang, A., Shao, D., Shaban, M., et al. (2024) · Nature Medicine · doi:10.1038/s41591-024-02857-3 · Cited by 1,560
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A., & Indyk, P. (2008) · Communications of the ACM · doi:10.1145/1327452.1327494 · Cited by 1,437
CAVER 3.0: A Tool for the Analysis of Transport Pathways in Dynamic Protein Structures
Chovancova, E., Pavelka, A., Benes, P., Strnad, O., Brezovsky, J., Kozlikova, B., Gora, A., Sustr, V., Klvana, M., Medek, P., et al. (2012) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002708 · Cited by 1,411
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
A review of methods for spike sorting: the detection and classification of neural action potentials
Lewicki, M. S. (1998) · Network Computation in Neural Systems · doi:10.1088/0954-898x/9/4/001 · Cited by 1,370
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
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
Yue, X., Wang, H., Jin, D., Li, M., & Jiang, W. (2016) · Journal of Medical Systems · doi:10.1007/s10916-016-0574-6 · Cited by 1,240
Distance-based outliers: algorithms and applications
Knorr, E. M., Ng, R. T., & Tucakov, V. (2000) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s007780050006 · Cited by 1,195
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
Escape from Cells: Deep Kd-Networks for the Recognition of 3D Point Cloud Models
Klokov, R., & Lempitsky, V. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.99 · Cited by 1,039
SO-Net: Self-Organizing Network for Point Cloud Analysis
Li, J., Chen, B. M., & Lee, G. H. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00979 · Cited by 985
Particle-flow reconstruction and global event description with the CMS detector
Sirunyan, A. M., Tumasyan, A., Adam, W., Asilar, E., Bergauer, T., Brandstetter, J., Brondolin, E., Dragicevic, M., Erö, J., Flechl, M., et al. (2017) · Journal of Instrumentation · doi:10.1088/1748-0221/12/10/p10003 · Cited by 981
k-Nearest Neighbour Classifiers - A Tutorial
Cunningham, P., & Delany, S. J. (2022) · ACM Computing Surveys · doi:10.1145/3459665 · Cited by 942
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
Robinson, J. T. (1981) · Proceedings of the 1981 ACM SIGMOD international conference on Management of data - SIGMOD '81 · doi:10.1145/582318.582321 · Cited by 888
Large-Scale Image Retrieval with Attentive Deep Local Features
Noh, H., Araujo, A., Sim, J., Weyand, T., & Han, B. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.374 · Cited by 847
Böhm, C., Berchtold, S., & Keim, D. A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502809 · Cited by 827
The SR-tree: an index structure for high-dimensional nearest neighbor queries
Katayama, N., & Satoh, S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253347 · Cited by 817
Semi-Supervised Hashing for Large-Scale Search
Wang, J., Kumar, S., & Chang, S.-F. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.48 · Cited by 810
dbscan: Fast Density-Based Clustering with R
Hahsler, M., Piekenbrock, M., & Doran, D. (2019) · Journal of Statistical Software · doi:10.18637/jss.v091.i01 · Cited by 802
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
CHOMP: Covariant Hamiltonian optimization for motion planning
Zucker, M., Ratliff, N., Dragan, A. D., Pivtoraiko, M., Klingensmith, M., Dellin, C. M., Bagnell, J. A., & Srinivasa, S. S. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913488805 · Cited by 758
An introduction to spatial database systems
G�ting, R. H. (1994) · The VLDB Journal · doi:10.1007/bf01231602 · Cited by 724
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
Multidimensional divide-and-conquer
Bentley, J. L. (1980) · Communications of the ACM · doi:10.1145/358841.358850 · Cited by 672
Self-citationEnsemble approaches for regression: A survey
Mendes-Moreira, J., Soares, C., Jorge, A. M., & Sousa, J. F. D. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379786 · Cited by 667
Berg, J., & Nyström, K. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.06.056 · Cited by 657
Data Structures for Range Searching
Bentley, J. L., & Friedman, J. H. (1979) · ACM Computing Surveys · doi:10.1145/356789.356797 · Cited by 622
Self-citationGlobal Illumination using Photon Maps
Jensen, H. W. (1996) · Eurographics · doi:10.1007/978-3-7091-7484-5_3 · Cited by 620
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Bay, S. D., & Schwabacher, M. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956758 · Cited by 613
Evaluating multiple classifiers for stock price direction prediction
Ballings, M., Van den Poel, D., Hespeels, N., & Gryp, R. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.05.013 · Cited by 611
Rotational Projection Statistics for 3D Local Surface Description and Object Recognition
Guo, Y., Sohel, F., Bennamoun, M., Lu, M., & Wan, J. (2013) · International Journal of Computer Vision · doi:10.1007/s11263-013-0627-y · Cited by 609
Image Inpainting : Overview and Recent Advances
Guillemot, C., & Le Meur, O. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2273004 · Cited by 608
Parallel Spectral Clustering in Distributed Systems
Chen, W.-Y., Song, Y., Bai, H., Lin, C.-J., & Chang, E. Y. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.88 · Cited by 603
Ma, J., Zhao, J., Jiang, J., Zhou, H., & Guo, X. (2019) · International Journal of Computer Vision · doi:10.1007/s11263-018-1117-z · Cited by 601
Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching
Shen, K., & Yu, W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2812748 · Cited by 578
Octrees for faster isosurface generation
Wilhelms, J., & Van Gelder, A. (1992) · ACM Transactions on Graphics · doi:10.1145/130881.130882 · Cited by 569
Fast collapsed gibbs sampling for latent dirichlet allocation
Porteous, I., Newman, D., Ihler, A., Asuncion, A., Smyth, P., & Welling, M. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401960 · Cited by 560
An Efficient Program for Many-Body Simulation
Appel, A. W. (1985) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0906008 · Cited by 546
Point convolutional neural networks by extension operators
Atzmon, M., Maron, H., & Lipman, Y. (2018) · ACM Transactions on Graphics · doi:10.1145/3197517.3201301 · Cited by 542
Vizzo, I., Guadagnino, T., Mersch, B., Wiesmann, L., Behley, J., & Stachniss, C. (2023) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2023.3236571 · Cited by 524
Study on density peaks clustering based on k-nearest neighbors and principal component analysis
Du, M., Ding, S., & Jia, H. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.02.001 · Cited by 520
Learning to Hash for Indexing Big Data—A Survey
Wang, J., Liu, W., Kumar, S., & Chang, S.-F. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2487976 · Cited by 519
Data stream clustering: A survey
Silva, J. A., Faria, E. R., Barros, R. C., Hruschka, E. R., Carvalho, A. C. P. L. F. D., & Gama, J. (2013) · ACM Computing Surveys · doi:10.1145/2522968.2522981 · Cited by 508
A Mark 1 Geographical Analysis Machine for the automated analysis of point data sets
OPENSHAW, S., CHARLTON, M., WYMER, C., & CRAFT, A. (1987) · International journal of geographical information systems · doi:10.1080/02693798708927821 · Cited by 508
Robust Feature Matching for Remote Sensing Image Registration via Locally Linear Transforming
Ma, J., Zhou, H., Zhao, J., Gao, Y., Jiang, J., & Tian, J. (2015) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2015.2441954 · Cited by 474
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
Optimistic parallelism requires abstractions
Kulkarni, M., Pingali, K., Walter, B., Ramanarayanan, G., Bala, K., & Chew, L. P. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250759 · Cited by 441
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
Accelerated Hierarchical Density Based Clustering
McInnes, L., & Healy, J. (2017) · 2017 IEEE International Conference on Data Mining Workshops (ICDMW) · doi:10.1109/icdmw.2017.12 · Cited by 434
Gene expression inference with deep learning
Chen, Y., Li, Y., Narayan, R., Subramanian, A., & Xie, X. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btw074 · Cited by 431
Approximate nearest neighbor algorithm based on navigable small world graphs
Malkov, Y., Ponomarenko, A., Logvinov, A., & Krylov, V. (2014) · Information Systems · doi:10.1016/j.is.2013.10.006 · Cited by 419
Detection of copy–move forgery using a method based on blur moment invariants
Mahdian, B., & Saic, S. (2007) · Forensic Science International · doi:10.1016/j.forsciint.2006.11.002 · Cited by 414
Multidimensional Binary Search Trees in Database Applications
Bentley, J. L. (1979) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1979.234200 · Cited by 410
Self-citationJoin processing in relational databases
Mishra, P., & Eich, M. H. (1992) · ACM Computing Surveys · doi:10.1145/128762.128764 · Cited by 409
A new vector quantization clustering algorithm
Equitz, W. H. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.35395 · Cited by 405
Multi-dimensional range queries in sensor networks
Li, X., Kim, Y. J., Govindan, R., & Hong, W. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958500 · Cited by 387
Survey of research towards robust peer-to-peer networks: Search methods
Risson, J., & Moors, T. (2006) · Computer Networks · doi:10.1016/j.comnet.2006.02.001 · Cited by 386
Voxelized GICP for Fast and Accurate 3D Point Cloud Registration
Koide, K., Yokozuka, M., Oishi, S., & Banno, A. (2021) · 2021 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra48506.2021.9560835 · Cited by 386
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
Efficient simulation of light transport in scences with participating media using photon maps
Jensen, H. W., & Christensen, P. H. (1998) · Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98 · doi:10.1145/280814.280925 · Cited by 383
Fast approximate nearest neighbor search with the navigating spreading-out graph
Fu, C., Xiang, C., Wang, C., & Cai, D. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3303753.3303754 · 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
Native architecture of the Chlamydomonas chloroplast revealed by in situ cryo-electron tomography
Engel, B. D., Schaffer, M., Kuhn Cuellar, L., Villa, E., Plitzko, J. M., & Baumeister, W. (2015) · eLife · doi:10.7554/elife.04889 · Cited by 375
Projection-based model reduction: Formulations for physics-based machine learning
Swischuk, R., Mainini, L., Peherstorfer, B., & Willcox, K. (2019) · Computers & Fluids · doi:10.1016/j.compfluid.2018.07.021 · Cited by 372
New approaches for delineating n‐dimensional hypervolumes
Blonder, B., Morrow, C. B., Maitner, B., Harris, D. J., Lamanna, C., Violle, C., Enquist, B. J., & Kerkhoff, A. J. (2018) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.12865 · Cited by 362
Loda: Lightweight on-line detector of anomalies
Pevný, T. (2016) · Machine Learning · doi:10.1007/s10994-015-5521-0 · Cited by 357
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
Selective Experience Replay for Lifelong Learning
Isele, D., & Cosgun, A. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11595 · Cited by 347
Interpretable Counterfactual Explanations Guided by Prototypes
Van Looveren, A., & Klaise, J. (2021) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-86520-7_40 · Cited by 346
Divergence Estimation for Multidimensional Densities Via $k$-Nearest-Neighbor Distances
Wang, Q., Kulkarni, S. R., & Verdu, S. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016060 · Cited by 342
Tour the world: Building a web-scale landmark recognition engine
Zheng, Y.-T., Zhao, M., Song, Y., Adam, H., Buddemeier, U., Bissacco, A., Brucher, F., Chua, T.-S., & Neven, H. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206749 · Cited by 341
Locality-Sensitive Hashing for Finding Nearest Neighbors [Lecture Notes]
Slaney, M., & Casey, M. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914237 · Cited by 340
Matching 2.5D face scans to 3D models
Lu, X., Jain, A. K., & Colbry, D. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.15 · Cited by 339
Finding nearest neighbors in growth-restricted metrics
Karger, D. R., & Ruhl, M. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.510013 · Cited by 334
Large-scale computation of elementary flux modes with bit pattern trees
Terzer, M., & Stelling, J. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn401 · Cited by 328
Rudd, E. M., Jain, L. P., Scheirer, W. J., & Boult, T. E. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2707495 · Cited by 326
Metadata
- Authors
- Bentley, J. L.
- Venue
- Communications of the ACM
- Published
- 1975-09
- Volume
- 18
- Issue
- 9
- Pages
- 509-517
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2165558283
- Cited by
- 7,520
- References
- 6
- FWCI
- 10.12
- 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.