Pages that link to "Item:Q690248"
From MaRDI portal
The following pages link to Point location in arrangements of hyperplanes (Q690248):
Displaying 40 items.
- Data-driven stabilization of unknown nonlinear dynamical systems using a cognition-based framework (Q345848) (← links)
- Quadratic stabilization of a nonlinear aeroelastic system using a novel neural-network-based controller (Q412952) (← links)
- An affine invariant \(k\)-nearest neighbor regression estimate (Q450849) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- Evaluating geometric queries using few arithmetic operations (Q694567) (← links)
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- Approximating nearest neighbor among triangles in convex position (Q975498) (← links)
- Locating lines and hyperplanes. Theory and algorithms (Q1282587) (← links)
- Point location among hyperplanes and unidirectional ray-shooting (Q1330461) (← links)
- Nearly sharp complexity bounds for multiprocessor algebraic computations (Q1361876) (← links)
- A lower bound for randomized algebraic decision trees (Q1386178) (← links)
- Systems of coordinates associated with points scattered in the plane (Q1391360) (← links)
- Anchored hyperplane location problems (Q1404501) (← links)
- On approximate nearest neighbors under \(l_\infty\) norm (Q1604212) (← links)
- Robust region elimination for piecewise affine control laws (Q1716676) (← links)
- Index structures for fast similarity search for real-valued vectors. I (Q1745711) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- Efficient evaluation of specific queries in constraint databases (Q1944172) (← links)
- Topological complexity of the range searching (Q1977139) (← links)
- On the multisource hyperplanes location problem to fitting set of points (Q2027036) (← links)
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- On 3SUM-hard problems in the decision tree model (Q2117780) (← links)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
- Conic nearest neighbor queries and approximate Voronoi diagrams (Q2261577) (← links)
- A note on point location in arrangements of hyperplanes (Q2390231) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- Finding a vector orthogonal to roughly half a collection of vectors (Q2479315) (← links)
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem (Q2796401) (← links)
- The point-location problem for three-dimensional space (Q2850433) (← links)
- (Q2939160) (← links)
- POSTURE INVARIANT CORRESPONDENCE OF INCOMPLETE TRIANGULAR MANIFOLDS (Q3602237) (← links)
- IMPLICIT POINT LOCATION IN ARRANGEMENTS OF LINE SEGMENTS, WITH AN APPLICATION TO MOTION PLANNING (Q4327385) (← links)
- Enumerating Projections of Integer Points in Unbounded Polyhedra (Q4638995) (← links)
- (Q5002761) (← links)
- Proximate planar point location (Q5361626) (← links)
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees (Q5458545) (← links)
- Approximating Minimization Diagrams and Generalized Proximity Search (Q5502175) (← links)
- Cell-probe lower bounds for the partial match problem (Q5917577) (← links)
