NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 3 results Save | Export
Peer reviewed Peer reviewed
Howard, Paul G.; Vitter, Jeffrey Scott – Information Processing and Management, 1992
Analyzes the amount of compression possible when arithmetic coding is used for text compression in conjunction with various input models. Algorithms are analyzed; modeling effects are considered; scaling is discussed; higher order models are examined, including prediction by partial matching; and coding effects are described. (34 references) (LRW)
Descriptors: Algorithms, Coding, Computation, Information Processing
Peer reviewed Peer reviewed
Bookstein, Abraham; And Others – Information Processing and Management, 1992
Discusses the problems of compressing a large textual database for storage on CD-ROM. A text-compression algorithm is presented, new algorithms for compression of indices are described, and the ARTFL (American and French Research on the Treasury of the French Language) database is used as an example. (14 references) (LRW)
Descriptors: Algorithms, Coding, Full Text Databases, Indexes
Scandura, Joseph M.; And Others – 1975
The research reported in this paper was designed to analyze the incidence of use of higher-order rules by students solving geometric construction problems. A carefully selected set of construction problems was subjected to rigorous a priori analysis by mathematics educators to determine what basic and second-order rules might be used by able high…
Descriptors: Algorithms, Artificial Intelligence, Cognitive Processes, Geometry