A quadtree algorithm for template matching on a pyramid computer
From MaRDI portal
Publication:1349703
DOI10.1016/0304-3975(94)00020-JzbMath0874.68131MaRDI QIDQ1349703
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
A quadtree algorithm for template matching on a pyramid computer, Proof that pyramid networks are 1-Hamiltonian-connected with high probability, Optimal and nearly optimal algorithms for approximating polynomial zeros, The \(3^{*}\)-connected property of pyramid networks, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Cites Work
