Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Data (E) > Data Structures (E.1) > Arrays (E.1...)  
 
Options:
 
  1-3 of 3 Reviews about "Arrays (E.1...)": Date Reviewed
  Bidirectional construction of suffix trees
Inenaga S. Nordic Journal of Computing 10(1): 52-67, 2003.  Type: Article

A linear-time algorithm for the bidirectional construction of suffix trees, which are the most basic index structures used in string processing, is presented in this paper....

Oct 7 2003
  Systolic convolution of arithmetic functions
Quinton P. (ed), Robert Y. (ed) Theoretical Computer Science 95(2): 207-229, 1992.  Type: Article

Kung introduced systolic arrays for fast computation [1]. They consist of a large number of elementary processors (cells) that are mesh interconnected according to a modular design. The high performance of the systolic model arises fro...

Sep 1 1993
  Structure handling in data-flow systems
Gaudiot J. IEEE Transactions on Computers 35(6): 489-502, 1986.  Type: Article

This paper addresses the problems associated with finding efficient means of representing, storing, and processing array data structures when these structures are accessed within loops in a dataflow system....

Dec 1 1986
 
 
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy