Multidimensional binary search trees used for associative searching
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A stochastic gradient type algorithm for closed-loop problems
- Computation, approximation and stability of explicit feedback min-max nonlinear model predictive control
- A survey of data mining techniques applied to agriculture
- Interpolation-based index maintenance
- Una struttura bidimensionale per la memorizzazione dei file trasposti
- Order dependency in the relational model
- The efficiency of using k-d trees for finding nearest neighbors in discrete space
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- Box sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems
- On neural network design. I: Using the MVQ algorithm
- Two general methods for dynamizing decomposable searching problems
- Randomly balanced binary trees
- Optimal choice of discriminators in a balanced K-D binary search tree
- Finding minimal spanning trees in a Euclidean coordinate space
- Multidimensional B-trees: Analysis of dynamic behavior
- Divided \(k-d\) trees
- Satisfying general proximity/similarity queries with metric trees
- An implicit data structure for searching a multikey table in logarithmic time
- A robust and efficient spatial data structure. The nested interpolation- based grid file
- Analysis of range searches in quad trees
- Information storage and retrieval - mathematical foundations. II: Combinatorial problems
- Non-uniform partial-match file designs
- Associative retrieval trie hash-coding
- Average case analysis of region search in balanced k-d trees
- A probabilistic framework for memory-based reasoning
- Driving tabu search with case-based reasoning
- Estimating the Held-Karp lower bound for the geometric TSP
- Analytic variations on quadtrees
- A new representation of binary search trees
- Optimal dynamic multi-attribute hashing for range queries
- Parallel solutions to geometric problems in the scan model of computation
- Optimal multiple key hashing files for orthogonal range queries
- Meshfree, probabilistic determination of point sets and support regions for meshless computing
- Feature space mapping as a universal adaptive system
- Intersections with random geometric objects
- Dynamic orthogonal range queries in OLAP.
- Approximate explicit receding horizon control of constrained nonlinear systems.
- Estimating mutual information for feature selection in the presence of label noise
- Efficient searching in meshfree methods
- Image colorization based on a generalization of the low dimensional manifold model
- Evaluating the importance of different communication types in romantic tie prediction on social media
- Lagrangian particle method for compressible fluid dynamics
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- Implicit local radial basis function interpolations based on function values
- Fast model predictive control combining offline method and online optimization with K-D tree
- Preparation of grids for simulations of groundwater flow in fractured porous media
- Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds
- Radial basis function generated finite differences for option pricing problems
- Kernel-based adaptive approximation of functions with discontinuities
- Projection-based model reduction: formulations for physics-based machine learning
- Exact and efficient top-\(K\) inference for multi-target prediction by querying separable linear relational models
- Anytime parallel density-based clustering
- A deterministic skip list for \(k\)-dimensional range search
- Generalised kernel weighted fuzzy c-means clustering algorithm with local information
- Adaptive interpolation algorithm based on a kd-tree for numerical integration of systems of ordinary differential equations with interval initial conditions
- Metric regression forests for correspondence estimation
- The properties of random trees
- 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.
- An algorithm for handling many relational calculus queries efficiently.
- Expected time analysis for Delaunay point location
- Determinstic VLSI block placement algorithm using less flexibility first principle
- 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
- Quasi-Monte-Carlo methods and the dispersion of point sequences
- Accounting for boundary effects in nearest-neighbor searching
- Dense neighborhoods on affinity graph
- Iterative estimation of rigid-body transformations
- Quantum speed-up for unsupervised learning
- Fast neighbor lists for adaptive-resolution particle simulations
- Transforming Tanimoto queries on real valued vectors to range queries in Euclidean space
- Machine learning based classification of normal, slow and fast walking by extracting multimodal features from stride interval time series
- pBO-2GP-3B: a batch parallel known/unknown constrained Bayesian optimization with feasibility classification and its applications in computational fluid dynamics
- POPMUSIC for the travelling salesman problem
- Efficient geometric reconstruction of complex geological structures
- Meshless local Petrov-Galerkin solution of the neutron transport equation with streamline-upwind Petrov-Galerkin stabilization
- 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
- Stochastic block models are a discrete surface tension
- Multi-dimensional tree guided efficient global association for decomposition-based evolutionary many-objective optimization
- ForestDSH: a universal hash design for discrete probability distributions
- Localized MQ-RBF meshless techniques for modeling unsaturated flow
- 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
- Probabilistic analysis of vantage point 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
- 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
- Model-free global likelihood subsampling for massive data
- Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds
- Peridynamics enabled learning partial differential equations
This page was built for publication: Multidimensional binary search trees used for associative searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4062679)
