Pages that link to "Item:Q4062679"
From MaRDI portal
The following pages link to Multidimensional binary search trees used for associative searching (Q4062679):
Displaying 50 items.
- Fast model predictive control combining offline method and online optimization with K-D tree (Q1667126) (← links)
- Preparation of grids for simulations of groundwater flow in fractured porous media (Q1684975) (← links)
- Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds (Q1702637) (← links)
- Radial basis function generated finite differences for option pricing problems (Q1732412) (← links)
- Kernel-based adaptive approximation of functions with discontinuities (Q1736123) (← links)
- Projection-based model reduction: formulations for physics-based machine learning (Q1739759) (← links)
- Exact and efficient top-\(K\) inference for multi-target prediction by querying separable linear relational models (Q1741286) (← links)
- Anytime parallel density-based clustering (Q1741415) (← links)
- A deterministic skip list for \(k\)-dimensional range search (Q1772103) (← links)
- Generalised kernel weighted fuzzy c-means clustering algorithm with local information (Q1795024) (← links)
- Adaptive interpolation algorithm based on a kd-tree for numerical integration of systems of ordinary differential equations with interval initial conditions (Q1798693) (← links)
- Metric regression forests for correspondence estimation (Q1799955) (← links)
- The properties of random trees (Q1825678) (← links)
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case (Q1841245) (← links)
- An effective quasi-human based heuristic for solving the rectangle packing problem (Q1847202) (← links)
- An efficient nearest neighbor search in high-dimensional data spaces (Q1847380) (← links)
- Comparison of various trees for nearest-point search with/without the Voronoi diagram. (Q1853098) (← links)
- Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- Expected time analysis for Delaunay point location (Q1882851) (← links)
- Determinstic VLSI block placement algorithm using less flexibility first principle (Q1884306) (← links)
- Embedded local search approaches for routing optimization (Q1886851) (← links)
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids (Q1894952) (← links)
- On optimal cuts of hyperrectangles (Q1900692) (← links)
- Quasi-Monte-Carlo methods and the dispersion of point sequences (Q1921094) (← links)
- Accounting for boundary effects in nearest-neighbor searching (Q1923772) (← links)
- Dense neighborhoods on affinity graph (Q1931579) (← links)
- Iterative estimation of rigid-body transformations (Q1932928) (← links)
- Quantum speed-up for unsupervised learning (Q1945031) (← links)
- Fast neighbor lists for adaptive-resolution particle simulations (Q1948865) (← links)
- Transforming Tanimoto queries on real valued vectors to range queries in Euclidean space (Q1959295) (← links)
- Machine learning based classification of normal, slow and fast walking by extracting multimodal features from stride interval time series (Q1980091) (← links)
- pBO-2GP-3B: a batch parallel known/unknown constrained Bayesian optimization with feasibility classification and its applications in computational fluid dynamics (Q1987855) (← links)
- POPMUSIC for the travelling salesman problem (Q1991147) (← links)
- Efficient geometric reconstruction of complex geological structures (Q1994879) (← links)
- Meshless local Petrov-Galerkin solution of the neutron transport equation with streamline-upwind Petrov-Galerkin stabilization (Q2002452) (← links)
- A multi-level method for data-driven finite element computations (Q2021891) (← links)
- Finite element solver for data-driven finite strain elasticity (Q2021912) (← links)
- Diffusion maps-aided neural networks for the solution of parametrized PDEs (Q2021984) (← links)
- Stochastic block models are a discrete surface tension (Q2022738) (← links)
- Multi-dimensional tree guided efficient global association for decomposition-based evolutionary many-objective optimization (Q2023160) (← links)
- ForestDSH: a universal hash design for discrete probability distributions (Q2036729) (← links)
- Localized MQ-RBF meshless techniques for modeling unsaturated flow (Q2040837) (← links)
- Estimating multi-index models with response-conditional least squares (Q2044313) (← links)
- Random projection-based auxiliary information can improve tree-based nearest neighbor search (Q2055550) (← links)
- An adaptive binary-tree element subdivision method for evaluation of volume integrals with continuous or discontinuous kernels (Q2058125) (← links)
- Probabilistic analysis of vantage point trees (Q2068978) (← links)
- Computing the topology of Voronoï diagrams of parallel half-lines (Q2071541) (← links)
- Projection-based model reduction of dynamical systems using space-time subspace and machine learning (Q2072456) (← links)
- Adaptive sparse approximations of scattered data (Q2077471) (← links)
