The following pages link to Michael E. Houle (Q686421):
Displaying 27 items.
- (Q208471) (redirect page) (← links)
- Algorithms for weak and wide separation of sets (Q686422) (← links)
- Theorems on the existence of separating surfaces (Q756705) (← links)
- Dimension-exchange token distribution on the mesh and the torus (Q1128825) (← links)
- The Steiner problem in distributed computing systems (Q1310949) (← links)
- (Q1575842) (redirect page) (← links)
- Optimal dimension-exchange token distribution on complete binary trees (Q1575843) (← links)
- On local transformation of polygons with visibility properties. (Q1853571) (← links)
- Dimension-exchange algorithms for token distribution on tree-connected architectures (Q1881301) (← links)
- Extreme-value-theoretic estimation of local intrinsic dimensionality (Q2287722) (← links)
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications (Q2367406) (← links)
- On the separability of quadrilaterals in the plane by translations and rotations (Q2400117) (← links)
- Graphs of triangulations and perfect matchings (Q2573802) (← links)
- (Q2766814) (← links)
- (Q2777822) (← links)
- (Q3043719) (← links)
- Approximate Shortest Path Queries Using Voronoi Duals (Q3052756) (← links)
- Computing the width of a set (Q3809267) (← links)
- (Q4028885) (← links)
- A Visibility Representation for Graphs in Three Dimensions (Q4397214) (← links)
- (Q4511244) (← links)
- (Q4525680) (← links)
- (Q4802576) (← links)
- COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES (Q4858650) (← links)
- Robust distance-based clustering with applications to spatial data mining (Q5945909) (← links)
- Every set of disjoint line segments admits a binary tree (Q5953078) (← links)
- Dimension-exchange token distribution on the mesh and the torus (Q6487448) (← links)
