Cache efficient data structures and algorithms for adaptive multidimensional multilevel finite element solvers

2008 ◽  
Vol 58 (4) ◽  
pp. 435-448 ◽  
Author(s):  
Judith Hartmann ◽  
Andreas Krahnke ◽  
Christoph Zenger
Keyword(s):  
Finite Element ◽  
Data Structures ◽  
Efficient Data ◽  
Cache Efficient ◽  
Data Structures And Algorithms ◽  
Efficient Data Structures

Indexing Textual Information

2009 ◽  
pp. 196-204
Author(s):  
Ioannis N. Kouris ◽  
Christos Makris ◽  
Evangelos Theodoridis ◽  
Athanasios Tsakalidis
Keyword(s):  
Information Retrieval ◽  
Data Structures ◽  
Textual Information ◽  
Design And Implementation ◽  
Efficient Data ◽  
Data Structures And Algorithms ◽  
Efficient Representation ◽  
Algorithmic Techniques ◽  
Efficient Data Structures ◽  
Information Objects

Information retrieval is the computational discipline that deals with the efficient representation, organization, and access to information objects that represent natural language texts (Baeza-Yates, & Ribeiro-Neto, 1999; Salton & McGill, 1983; Witten, Moûat, & Bell, 1999). A crucial subproblem in the information retrieval area is the design and implementation of efficient data structures and algorithms for indexing and searching information objects that are vaguely described. In this article, we are going to present the latest developments in the indexing area by giving special emphasis to: data structures and algorithmic techniques for string manipulation, space efficient implementations, and compression techniques for efficient storage of information objects.

Sign in / Sign up

Export Citation Format

Share Document