Pages that link to "Item:Q1349703"
From MaRDI portal
The following pages link to A quadtree algorithm for template matching on a pyramid computer (Q1349703):
Displaying 6 items.
- The \(3^{*}\)-connected property of pyramid networks (Q623179) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- A quadtree algorithm for template matching on a pyramid computer (Q1349703) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- Proof that pyramid networks are 1-Hamiltonian-connected with high probability (Q2384537) (← links)
