Multidimensional binary search trees used for associative searching
From MaRDI portal
Publication:4062679
DOI10.1145/361002.361007zbMath0306.68061OpenAlexW2165558283WikidataQ56638869 ScholiaQ56638869MaRDI QIDQ4062679
Publication date: 1975
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/361002.361007
Formal languages and automata (68Q45) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
An algorithm for handling many relational calculus queries efficiently., Peridynamics enabled learning partial differential equations, Automatic topography of high-dimensional data sets by non-parametric density peak clustering, Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance, Online machine learning techniques for Coq: a comparison, Expected time analysis for Delaunay point location, Topology from time series, Determinstic VLSI block placement algorithm using less flexibility first principle, Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments, Embedded local search approaches for routing optimization, A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids, On optimal cuts of hyperrectangles, Cloud-assisted secure biometric identification with sub-linear search efficiency, Fast spectral analysis for approximate nearest neighbor search, Automated flexion crease identification using internal image seams, Image replica detection system utilizing R-trees and linear discriminant analysis, Range searching in multidimensional databases using navigation metadata, A new internal index based on density core for clustering validation, Fast model predictive control combining offline method and online optimization with K-D tree, Quasi-Monte-Carlo methods and the dispersion of point sequences, Max-plus approximation for reinforcement learning, Accounting for boundary effects in nearest-neighbor searching, Predicting spatio-temporal time series using dimension reduced local states, Dense neighborhoods on affinity graph, Preparation of grids for simulations of groundwater flow in fractured porous media, Iterative estimation of rigid-body transformations, Locality preserving matching, Biased range trees, Quantum speed-up for unsupervised learning, Fast neighbor search by using revised \(k\)-d tree, Variations of largest rectangle recognition amidst a bichromatic point set, Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds, Stochastic distance transform: theory, algorithms and applications, Fast neighbor lists for adaptive-resolution particle simulations, Transforming Tanimoto queries on real valued vectors to range queries in Euclidean space, Posterior concentration for Bayesian regression trees and forests, Multibody multipole methods, Distance fields on unstructured grids: stable interpolation, assumed gradients, collision detection and gap function, A high order method for pricing of financial derivatives using radial basis function generated finite differences, Rotational projection statistics for 3D local surface description and object recognition, The localized RBFs collocation methods for solving high dimensional PDEs, Radial basis function generated finite differences for option pricing problems, Kernel-based adaptive approximation of functions with discontinuities, Concurrent linearizable nearest neighbour search in LockFree-kD-tree, Machine learning based classification of normal, slow and fast walking by extracting multimodal features from stride interval time series, Projection-based model reduction: formulations for physics-based machine learning, Anomaly detection in a mobile communication network, Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures, Exact and efficient top-\(K\) inference for multi-target prediction by querying separable linear relational models, Anytime parallel density-based clustering, Efficient data structures for model-free data-driven computational mechanics, A kd-tree-accelerated hybrid data-driven/model-based approach for poroelasticity problems with multi-fidelity multi-physics data, pBO-2GP-3B: a batch parallel known/unknown constrained Bayesian optimization with feasibility classification and its applications in computational fluid dynamics, A higher-order finite element method with unstructured anisotropic mesh adaption for two phase flows with surface tension, POPMUSIC for the travelling salesman problem, Implicit reconstructions of thin leaf surfaces from large, noisy point clouds, Efficient geometric reconstruction of complex geological structures, Symbolic image indexing and retrieval by spatial similarity: An approach based on B-tree, Meshless local Petrov-Galerkin solution of the neutron transport equation with streamline-upwind Petrov-Galerkin stabilization, A deterministic skip list for \(k\)-dimensional range search, Finding representative landmarks of data on manifolds, A multi-level method for data-driven finite element computations, Finite element solver for data-driven finite strain elasticity, Diffusion maps-aided neural networks for the solution of parametrized PDEs, A limit field for orthogonal range searches in two-dimensional random point search trees, Stochastic block models are a discrete surface tension, Multi-dimensional tree guided efficient global association for decomposition-based evolutionary many-objective optimization, An efficient and parallel level set reinitialization method -- application to micromechanics and microstructural evolutions, ForestDSH: a universal hash design for discrete probability distributions, Generalised kernel weighted fuzzy c-means clustering algorithm with local information, The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching, Fast discrete convolution in \(\mathbb{R}^2\) with radial kernels using non-uniform fast Fourier transform with nonequispaced frequencies, Maximum-likelihood approximate nearest neighbor method in real-time image recognition, Adaptive interpolation algorithm based on a kd-tree for numerical integration of systems of ordinary differential equations with interval initial conditions, Localized MQ-RBF meshless techniques for modeling unsaturated flow, Metric regression forests for correspondence estimation, Monte Carlo simulation of radiative transfer in a medium with varying refractive index specified at discrete points, Estimating multi-index models with response-conditional least squares, Random projection-based auxiliary information can improve tree-based nearest neighbor search, An adaptive binary-tree element subdivision method for evaluation of volume integrals with continuous or discontinuous kernels, A modified discrete-vortex method algorithm with shedding criterion for aerodynamic coefficients prediction at high angle of attack, A massively-parallel, unstructured overset method for mesh connectivity, A binary-tree element subdivision method for evaluation of nearly singular domain integrals with continuous or discontinuous kernel, Probabilistic analysis of vantage point trees, The properties of random trees, Computing the topology of Voronoï diagrams of parallel half-lines, Projection-based model reduction of dynamical systems using space-time subspace and machine learning, Adaptive sparse approximations of scattered data, Diffusion nets, Geometric prior of multi-resolution yielding manifolds and the local closest point projection for nearly non-smooth plasticity, A multigrid preconditioner for spatially adaptive high-order meshless method on fluid-solid interaction problems, A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case, An effective quasi-human based heuristic for solving the rectangle packing problem, An efficient nearest neighbor search in high-dimensional data spaces, Comparison of various trees for nearest-point search with/without the Voronoi diagram., Efficient splitting and merging algorithms for order decomposable problems., A numerical algorithm for multidimensional modeling of scattered data points, Model-free global likelihood subsampling for massive data, Randomized partition trees for nearest neighbor search, Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds, Numerical solution of time-fractional fourth-order reaction-diffusion model arising in composite environments, Optimal multiple key hashing files for orthogonal range queries, Estimating mutual information for feature selection in the presence of label noise, Efficient dynamic range searching using data replication, Efficient searching in meshfree methods, Loda: lightweight on-line detector of anomalies, Image colorization based on a generalization of the low dimensional manifold model, The efficiency of using k-d trees for finding nearest neighbors in discrete space, On the cost of fixed partial match queries in \(K\)-d trees, Meshfree, probabilistic determination of point sets and support regions for meshless computing, Evaluating the importance of different communication types in romantic tie prediction on social media, Halfplanar range search in linear space and \(O(n^{0.695})\) query time, Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates, Lagrangian particle method for compressible fluid dynamics, Box sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching, Fast and versatile algorithm for nearest neighbor search based on a lower bound tree, Faster and more robust point symmetry-based K-means algorithm, VCS: A new heuristic function for selecting boxes in the single container loading problem, Controlling the weights of simulation particles: adaptive particle management using \(k\)-d trees, Particulate flows with the subspace projection method, Multi-scale modelling of flow in periodic solid structures through spatial averaging, Cellular tree classifiers, (Approximate) uncertain skylines, Implicit local radial basis function interpolations based on function values, Feature space mapping as a universal adaptive system, Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems, On neural network design. I: Using the MVQ algorithm, Generalized \(k\)-\(d\)-trees and local reorganizations, A limit process for partial match queries in random quadtrees and 2-d trees, Intersections with random geometric objects, Dynamic orthogonal range queries in OLAP., Multiple feature kernel hashing for large-scale visual search, Reasoning about visibility, Two general methods for dynamizing decomposable searching problems, Maxima-finding algorithms for multidimensional samples: A two-phase approach, Randomly balanced binary trees, A \(kd\)-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves, Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees, Modeling the evolution space of breakage fusion bridge cycles with a stochastic folding process, HD tree: A novel data structure to support multi-dimensional range query for P2P networks, Optimal choice of discriminators in a balanced K-D binary search tree, Finding minimal spanning trees in a Euclidean coordinate space, An adaptive multiresolution method on dyadic grids: Application to transport equations, Construction of a tree from its traversals in optimal time and space, Multidimensional B-trees: Analysis of dynamic behavior, A guide to RBF-generated finite differences for nonlinear transport: shallow water simulations on a sphere, Pivot selection: dimension reduction for distance-based indexing, Performance analysis of file organizations that use multi-bucket data leaves, Approximate explicit receding horizon control of constrained nonlinear systems., An adaptive domain-decomposition technique for parallelization of the fast marching method, Weighted height of random trees, Divided \(k-d\) trees, Satisfying general proximity/similarity queries with metric trees, The combinatorics of tandem duplication, A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning, An implicit data structure for searching a multikey table in logarithmic time, A variant of \(k\)-nearest neighbors search with cyclically permuted query points for rotation-invariant image processing, Group nearest-neighbor queries in the \(L_1\) plane, Localized homology, Probability density function estimation with the frequency polygon transform, A robust and efficient spatial data structure. The nested interpolation- based grid file, A new clustering algorithm for coordinate-free data, Probably correct \(k\)-nearest neighbor search in high dimensions, A second-order curvilinear to Cartesian transformation of immersed interfaces and boundaries. Application to fictitious domains and multiphase flows, Algorithms for marketing-mix optimization, A simple and deterministic competitive algorithm for online facility location, Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids, Analysis of range searches in quad trees, Untangled monotonic chains and adaptive range search, Data analysis using a geometrical representation of predicate calculus, Information storage and retrieval - mathematical foundations. II: Combinatorial problems, Fast distance transformation on irregular two-dimensional grids, Nearest neighbour group-based classification, Non-uniform partial-match file designs, Mesh-free data transfer algorithms for partitioned multiphysics problems: conservation, accuracy, and parallelism, Associative retrieval trie hash-coding, Average case analysis of region search in balanced k-d trees, A hierarchical detection framework for computational contact mechanics, A stochastic gradient type algorithm for closed-loop problems, Reduction operations for constraint satisfaction, Computation, approximation and stability of explicit feedback min-max nonlinear model predictive control, A probabilistic framework for memory-based reasoning, Driving tabu search with case-based reasoning, A survey of data mining techniques applied to agriculture, Compact and succinct data structures for multidimensional orthogonal range searching, Feature guided Gaussian mixture model with semi-supervised EM and local geometric constraint for retinal image registration, Estimating the Held-Karp lower bound for the geometric TSP, An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers, A binary-tree element subdivision method for evaluation of singular domain integrals with continuous or discontinuous kernel, Interpolation-based index maintenance, A counter example to a monotonicity property of k-d trees, Una struttura bidimensionale per la memorizzazione dei file trasposti, Secondary attribute retrieval using tree data structures, Partial match retrieval in implicit data structures, Analytic variations on quadtrees, A new representation of binary search trees, Refinements to nearest-neighbor searching in k-dimensional trees, Optimal dynamic multi-attribute hashing for range queries, Parallel solutions to geometric problems in the scan model of computation, Order dependency in the relational model, Sequential Bayesian experimental design for implicit models via mutual information, An explained artificial intelligence-based solution to identify depression severity symptoms using acoustic features, Estimating Mixed Memberships With Sharp Eigenvector Deviations, An augmented spatial digital tree algorithm for contact detection in computational mechanics, Fast Mesh-to-Mesh Remaps Using Hash Algorithms, Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization, Multidimensional binary partitions: distributed data structures for spatial partitioning, The K-D heap: An efficient multi-dimensional priority queue, d-blink: Distributed End-to-End Bayesian Entity Resolution, Polynomial Data Structure Lower Bounds in the Group Model, FAST SOFTWARE FOR BOX INTERSECTIONS, TWO-DIMENSIONAL RANGE SEARCH BASED ON THE VORONOI DIAGRAM, Unnamed Item, Efficient splitting and merging algorithms for order decomposable problems, Solving biharmonic equation using the localized method of approximate particular solutions, Multidimensional extendible hashing for partial-match queries, Maintaining α-balanced trees by partial rebuilding, Geometry Helps to Compare Persistence Diagrams, Fast stepwise regression based on multidimensional indexes, Unnamed Item, A matheuristic for large-scale capacitated clustering, On the solution of hyperbolic equations using the peridynamic differential operator, Performance analysis of partial-match search algorithms for BD trees, Robust event-driven particle tracking in complex geometries, Improved quantum supersampling for quantum ray tracing, Asynchronous collision integrators: Explicit treatment of unilateral contact with friction and nodal restraints, Distance minimizing based <scp>data‐driven</scp> computational method for the finite deformation of hyperelastic materials, A custom arc‐length Finite Element solver for large deformation adhesive contacts using a k‐d tree accelerated volumetric interaction scheme, Phase‐resolving direct numerical simulations of particle transport in liquids—From microfluidics to sediment, “Touch‐aware” contact model for peridynamics modeling of granular systems, An optimal-transport finite-particle method for mass diffusion, A novel oversampling technique for class-imbalanced learning based on SMOTE and natural neighbors, Linear-Cost Covariance Functions for Gaussian Random Fields, An extension to \textsc{Voro++} for multithreaded computation of Voronoi cells, Bayesian Modeling and Classification of Neural Signals, Algorithms for BD trees, Finding our way in the dark: approximate MCMC for approximate Bayesian methods, Haar-like wavelets on hierarchical trees, On the expected cost of partial match queries in random quad-\(K\)-d trees, A computationally efficient estimator for mutual information, Monotone meshfree methods for linear elliptic equations in non-divergence form via nonlocal relaxation, VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search, FaVAD: a software workflow for characterization and visualizing of defects in crystalline structures, A general method for numerical identifiability and sensitivity analysis of failure criteria for continuous fibre-reinforced plastics, Median and hybrid median \(K\)-dimensional trees, Optimal window queries on line segments using the trapezoidal search DAG, A data-driven approach for plasticity using history surrogates: theory and application in the context of truss structures, Fast Bayesian inference of block nearest neighbor Gaussian models for large data, Scalable computations for nonstationary Gaussian processes, Approximated multi-agent fitted Q iteration, Data-driven computational method for growth-induced deformation problems of soft materials, X-FIST: extended flood index for efficient similarity search in massive trajectory dataset, Detecting the large entries of a sparse covariance matrix in sub-quadratic time, Simplex Range Searching and Its Variants: A Review, Relativistic space-charge field calculation by interpolation-based treecode, Analysis of Highly Accurate Finite Element Based Algorithms for Computing Distances to Level Sets, Can we detect clusters of chaotic dynamical networks via causation entropy?, SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS, Resolvability of Hamming Graphs, GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING, Growing Self-Organizing Surface Map: Learning a Surface Topology from a Point Cloud, 8k-ary Grid Graph Models of Tabular Forms, Unnamed Item, Unnamed Item, Numerical Simulation of Non-Linear Schrodinger Equations in Arbitrary Domain by the Localized Method of Approximate Particular Solution, An Effective Framework for Path Planning Amidst Movable Obstacles, FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING, Unnamed Item, DATA MINING AND MACHINE LEARNING IN ASTRONOMY, Optimal binary search trees, Neighborhood Property–Based Pattern Selection for Support Vector Machines, Regular and non-regular point sets: Properties and reconstruction, Unnamed Item, Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem, Rapid Multipole Graph Drawing on the GPU, Distance Transformation on Two-Dimensional Irregular Isothetic Grids, CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction*, Unnamed Item, A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee, A distributed kernel summation framework for general‐dimension machine learning, Dual‐tree fast exact max‐kernel search, Hierarchical Decompositions for the Computation of High-Dimensional Multivariate Normal Probabilities, A FAST ALGORITHM FOR COMPUTING SAMPLE ENTROPY, Space-time meshfree collocation method: Methodology and application to initial-boundary value problems, Isocontour based Visualization of Time-varying Scalar Fields, Partial match queries in random quadtrees, Stochastic Distance Transform, An application of $m$-ary trees to the design of data structures for geometric searching problems, An efficient simplification method for point cloud based on salient regions detection, Succinct and Implicit Data Structures for Computational Geometry, Non-parametric estimation of residual moments and covariance, A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM, Unnamed Item, Unnamed Item, Unnamed Item, Designing Complex Interplanetary Trajectories for the Global Trajectory Optimization Competitions, Elastic-Degenerate String Matching via Fast Matrix Multiplication, Accelerating Fourier–Motzkin elimination using bit pattern trees, Fractal image compression, Selection by rank inK-dimensional binary search trees, Fast kd-tree-based hierarchical radiosity for radiative heat transport problems
