The following pages link to Multidimensional divide-and-conquer (Q148390):
Displayed 46 items.
- Robust weighted Gaussian processes (Q1995846) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Boundary estimation from point clouds: algorithms, guarantees and applications (Q2161815) (← links)
- K-dominance in multidimensional data: theory and applications (Q2173457) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- Fast multivariate empirical cumulative distribution function with connection to kernel density estimation (Q2242044) (← links)
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← links)
- Average stretch factor: how low does it go? (Q2340408) (← links)
- Optimal \(L_2\)-norm empirical importance weights for the change of probability measure (Q2361444) (← links)
- The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- Biased range trees (Q2428657) (← links)
- An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case (Q2637298) (← links)
- A localized meshless approach for modeling spatial-temporal calcium dynamics in ventricular myocytes (Q2896334) (← links)
- Efficient range searching for categorical and plain data (Q2943571) (← links)
- A FAST ALGORITHM FOR COMPUTING SAMPLE ENTROPY (Q3101552) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q3122310) (← links)
- The average performance analysis of a closest‐pair algorithm (Q3339288) (← links)
- EXTERNAL MEMORY ORTHOGONAL RANGE REPORTING WITH FAST UPDATES (Q3459358) (← links)
- A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES (Q3628098) (← links)
- Using persistent data structures for adding range restrictions to searching problems (Q4362274) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Learning Binary Hash Codes for Large-Scale Image Search (Q4649217) (← links)
- OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS (Q4667924) (← links)
- An application of $m$-ary trees to the design of data structures for geometric searching problems (Q4730791) (← links)
- FAST SOFTWARE FOR BOX INTERSECTIONS (Q4818605) (← links)
- A general framework for efficient clustering of large datasets based on activity detection (Q4969747) (← links)
- Accounting for Factor Variables in Big Data Regression (Q4986359) (← links)
- (Q4999080) (← links)
- (Q5009466) (← links)
- MEPDF: Multivariate empirical density functions (Q5083986) (← links)
- A New Lower Bound for Semigroup Orthogonal Range Searching (Q5088928) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model (Q5090986) (← links)
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ<sup>3</sup> (Q5108270) (← links)
- K-Dominance in Multidimensional Data: Theory and Applications (Q5111754) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q5115796) (← links)
- Dominance Product and High-Dimensional Closest Pair under L_infty (Q5136258) (← links)
- Space Efficient Multi-dimensional Range Reporting (Q5323066) (← links)
- Gathering in the plane of location-aware robots in the presence of spies (Q5918903) (← links)
- Robust Monte Carlo localization for mobile robots (Q5941134) (← links)
- Finding top-\(k\) longest palindromes in substrings (Q6057835) (← links)
- An Improved Vectorization Algorithm to Solve the d-MP Problem (Q6088964) (← links)
- A condition for the identification of multivariate models with binary instruments (Q6163277) (← links)
- Dominance in the presence of obstacles (Q6199464) (← links)