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.
- Efficient dynamic range searching using data replication (Q293421) (← links)
- Loda: lightweight on-line detector of anomalies (Q298359) (← links)
- On the cost of fixed partial match queries in \(K\)-d trees (Q308949) (← links)
- Controlling the weights of simulation particles: adaptive particle management using \(k\)-d trees (Q348706) (← links)
- Particulate flows with the subspace projection method (Q348783) (← links)
- Multi-scale modelling of flow in periodic solid structures through spatial averaging (Q349808) (← links)
- Cellular tree classifiers (Q358883) (← links)
- (Approximate) uncertain skylines (Q359874) (← links)
- Generalized \(k\)-\(d\)-trees and local reorganizations (Q384731) (← links)
- A limit process for partial match queries in random quadtrees and 2-d trees (Q389077) (← links)
- Reasoning about visibility (Q420853) (← links)
- Maxima-finding algorithms for multidimensional samples: A two-phase approach (Q425621) (← links)
- An adaptive multiresolution method on dyadic grids: Application to transport equations (Q432787) (← links)
- A guide to RBF-generated finite differences for nonlinear transport: shallow water simulations on a sphere (Q447582) (← links)
- Pivot selection: dimension reduction for distance-based indexing (Q450522) (← links)
- The combinatorics of tandem duplication (Q494419) (← links)
- A variant of \(k\)-nearest neighbors search with cyclically permuted query points for rotation-invariant image processing (Q499379) (← links)
- Group nearest-neighbor queries in the \(L_1\) plane (Q500965) (← links)
- Probability density function estimation with the frequency polygon transform (Q528669) (← links)
- A second-order curvilinear to Cartesian transformation of immersed interfaces and boundaries. Application to fictitious domains and multiphase flows (Q536785) (← links)
- Algorithms for marketing-mix optimization (Q547308) (← links)
- Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids (Q550889) (← links)
- Untangled monotonic chains and adaptive range search (Q553358) (← links)
- Data analysis using a geometrical representation of predicate calculus (Q578939) (← links)
- HD tree: A novel data structure to support multi-dimensional range query for P2P networks (Q635389) (← links)
- An adaptive domain-decomposition technique for parallelization of the fast marching method (Q658651) (← links)
- A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning (Q670431) (← links)
- A simple and deterministic competitive algorithm for online facility location (Q703850) (← links)
- Mesh-free data transfer algorithms for partitioned multiphysics problems: conservation, accuracy, and parallelism (Q729375) (← links)
- A hierarchical detection framework for computational contact mechanics (Q741944) (← links)
- Reduction operations for constraint satisfaction (Q754642) (← links)
- Compact and succinct data structures for multidimensional orthogonal range searching (Q776842) (← links)
- Feature guided Gaussian mixture model with semi-supervised EM and local geometric constraint for retinal image registration (Q778449) (← links)
- An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers (Q780930) (← links)
- A binary-tree element subdivision method for evaluation of singular domain integrals with continuous or discontinuous kernel (Q785061) (← links)
- A counter example to a monotonicity property of k-d trees (Q789903) (← links)
- Secondary attribute retrieval using tree data structures (Q798014) (← links)
- Partial match retrieval in implicit data structures (Q800083) (← links)
- Refinements to nearest-neighbor searching in k-dimensional trees (Q802864) (← links)
- Numerical solution of time-fractional fourth-order reaction-diffusion model arising in composite environments (Q822129) (← links)
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172) (← links)
- Fast and versatile algorithm for nearest neighbor search based on a lower bound tree (Q854189) (← links)
- Faster and more robust point symmetry-based K-means algorithm (Q854200) (← links)
- Multiple feature kernel hashing for large-scale visual search (Q898328) (← links)
- A \(kd\)-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves (Q905994) (← links)
- Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees (Q906406) (← links)
- Modeling the evolution space of breakage fusion bridge cycles with a stochastic folding process (Q907112) (← links)
- Construction of a tree from its traversals in optimal time and space (Q910183) (← links)
- Performance analysis of file organizations that use multi-bucket data leaves (Q918665) (← links)
- Weighted height of random trees (Q934911) (← links)
