On a Parallel Implementation of Geometric Hashing On the Connection Machine
On a Parallel Implementation of Geometric Hashing On the Connection Machine
The book On a Parallel Implementation of Geometric Hashing On the Connection Machine was written by author Here you can read free online of On a Parallel Implementation of Geometric Hashing On the Connection Machine book, rate and share your impressions in comments. If you don't know what to write, just answer the question: Why is On a Parallel Implementation of Geometric Hashing On the Connection Machine a good or bad book?
Where can I read On a Parallel Implementation of Geometric Hashing On the Connection Machine for free?
In our eReader you can find the full English version of the book. Read On a Parallel Implementation of Geometric Hashing On the Connection Machine Online - link to read the book on full screen. Our eReader also allows you to upload and read Pdf, Txt, ePub and fb2 books. In the Mini eReder on the page below you can quickly view all pages of the book - Read Book On a Parallel Implementation of Geometric Hashing On the Connection Machine
In our eReader you can find the full English version of the book. Read On a Parallel Implementation of Geometric Hashing On the Connection Machine Online - link to read the book on full screen. Our eReader also allows you to upload and read Pdf, Txt, ePub and fb2 books. In the Mini eReder on the page below you can quickly view all pages of the book - Read Book On a Parallel Implementation of Geometric Hashing On the Connection Machine
What reading level is On a Parallel Implementation of Geometric Hashing On the Connection Machine book?
To quickly assess the difficulty of the text, read a short excerpt:
The computation proceeds as outlined in Section 4. We tested the implementation with a large number of scenes. For cases (1) through (4) above, the recognition process takes 3. 4 seconds; between 7 and 10 milliseconds are spent on the computational part of the algorithm and the remainder of the time is devoted to the voting process. When we make use of the rehashing functions and of the appropriate uniform hash table, the recognition process is completed in 1. 2 seconds with 8K processors. It m...ust be stressed here that none of the above experiments makes use of the existing hash table symmetries; exploitation of those symmetries would speed up the recognition by a factor of 2, bringing the time required to perform recognition down to 0. 60 seconds on an 8K Connection Machine. This is because only half of the hash table must be stored in the Connection Machine, and thus the length of the lists of entries will be halved. Use of the folding (tiiereby using basis sets instead of basis pairs) would incur even greater computational savings.
What to read after On a Parallel Implementation of Geometric Hashing On the Connection Machine?
You can find similar books in the "Read Also" column, or choose other free books by Isidore Rigoutsos to read onlineMoreLess
To quickly assess the difficulty of the text, read a short excerpt:
The computation proceeds as outlined in Section 4. We tested the implementation with a large number of scenes. For cases (1) through (4) above, the recognition process takes 3. 4 seconds; between 7 and 10 milliseconds are spent on the computational part of the algorithm and the remainder of the time is devoted to the voting process. When we make use of the rehashing functions and of the appropriate uniform hash table, the recognition process is completed in 1. 2 seconds with 8K processors. It m...ust be stressed here that none of the above experiments makes use of the existing hash table symmetries; exploitation of those symmetries would speed up the recognition by a factor of 2, bringing the time required to perform recognition down to 0. 60 seconds on an 8K Connection Machine. This is because only half of the hash table must be stored in the Connection Machine, and thus the length of the lists of entries will be halved. Use of the folding (tiiereby using basis sets instead of basis pairs) would incur even greater computational savings.
What to read after On a Parallel Implementation of Geometric Hashing On the Connection Machine?
You can find similar books in the "Read Also" column, or choose other free books by Isidore Rigoutsos to read onlineMoreLess
Write Review:
Guest
Read Also
8 / 10
9 / 10
9 / 10
User Reviews: