String Processing and Information Retrieval 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002 Proceedings /

String Processing and Information Retrieval 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002 Proceedings /

This volume of the Lecture Notes in Computer Science series provides a c- prehensive, state-of-the-art survey of recent advances in string processing and information retrieval. It includes invited and research papers presented at the 9th International Symposium on String Processing and Information R...

Full description

Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Laender, Alberto H.F (Editor, http://id.loc.gov/vocabulary/relators/edt), Oliveira, Arlindo L. (Editor, http://id.loc.gov/vocabulary/relators/edt)
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
Edition:1st ed. 2002.
Series:Lecture Notes in Computer Science, 2476
Subjects:
Database management.
Information storage and retrieval.
Algorithms.
Artificial intelligence.
Data structures (Computer science).
Database Management.
Information Storage and Retrieval.
Algorithm Analysis and Problem Complexity.
Artificial Intelligence.
Data Structures and Information Theory.
Data Structures.
Online Access:Full Text via HEAL-Link
Table of Contents:
  • Invited Papers
  • The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives
  • From Searching Text to Querying XML Streams
  • String Matching Problems from Bioinformatics Which Still Need Better Solutions
  • String Matching
  • Optimal Exact String Matching Based on Suffix Arrays
  • Faster String Matching with Super-Alphabets
  • On the Size of DASG for Multiple Texts
  • String Processing
  • Sorting by Prefix Transpositions
  • Efficient Computation of Long Similar Subsequences
  • Stemming Galician Texts
  • Firing Policies for an Arabic Rule-Based Stemmer
  • Web Ranking and Link Analysis
  • Enhancing the Set-Based Model Using Proximity Information
  • Web Structure, Dynamics and Page Quality
  • A Theoretical Analysis of Google's PageRank
  • Machine Learning Approach for Homepage Finding Task
  • Pattern Matching
  • Tree Pattern Matching for Linear Static Terms
  • Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts
  • Pattern Matching over Multi-attribute Data Streams
  • Digital Libraries and Applications
  • Java MARIAN: From an OPAC to a Modern Digital Library System
  • A Framework for Generating Attribute Extractors for Web Data Sources
  • Multiple Example Queries in Content-Based Image Retrieval
  • Focussed Structured Document Retrieval
  • Towards a More Comprehensive Comparison of Collaborative Filtering Algorithms
  • Approximate Searching
  • Fully Dynamic Spatial Approximation Trees
  • String Matching with Metric Trees Using an Approximate Distance
  • Probabilistic Proximity Searching Algorithms Based on Compact Partitions
  • Indexing Techniques
  • t-Spanners as a Data Structure for Metric Space Searching
  • Compact Directed Acyclic Word Graphs for a Sliding Window
  • Indexing Text Using the Ziv-Lempel Trie.

Similar Items