Computing Hough transforms on hypercube multicomputers (Q547488): Difference between revisions

@@ Property / author @@
-Sartaj K. Sahni
@@ Property / author: Sartaj K. Sahni / rank @@
-Normal rank
@@ Property / author @@
+Sartaj K. Sahni
@@ Property / author: Sartaj K. Sahni / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Generalizing the Hough transform to detect arbitrary shapes
+Normal rank
@@ Property / cites work @@
+The Hough Transform Has $O(N)$ Complexity on $N \times N$ Mesh Connected Computers
+Normal rank
@@ Property / cites work @@
+Parallel Matrix and Graph Algorithms
@@ Property / cites work: Parallel Matrix and Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4195901
@@ Property / cites work: Q4195901 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms for image template matching on hypercube SIMD machines
+Normal rank
@@ Property / cites work @@
+Q3999600
@@ Property / cites work: Q3999600 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3679095
@@ Property / cites work: Q3679095 / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting on a mesh-connected parallel computer
@@ Property / cites work: Sorting on a mesh-connected parallel computer / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:547488