1 option
String Processing and Information Retrieval : 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002 Proceedings / edited by Alberto H.F. Laender, Arlindo L. Oliveira.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2476.
- Lecture Notes in Computer Science, 0302-9743 ; 2476
- Language:
- English
- Subjects (All):
- 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.
- Local Subjects:
- Database Management.
- Information Storage and Retrieval.
- Algorithm Analysis and Problem Complexity.
- Artificial Intelligence.
- Data Structures and Information Theory.
- Data Structures.
- Physical Description:
- 1 online resource (XII, 344 pages).
- Edition:
- First edition 2002.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
- System Details:
- text file PDF
- Summary:
- 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 Retrieval, SPIRE2002, held in Lisbon, Portugal. SPIREhas its origins in the South Am- ican Workshop on String Processing which was ?rst held in Belo Horizonte, Brazil, in 1993. Starting in 1998, the focus of the workshop was broadened to include the area of information retrieval due to its increasing relevance and its inter-relationship with the area of string processing. The call for papers for SPIRE2002 resulted in the submission of 54 papers from researchers around the world. Of these, 19 were selected for inclusion in the program (an acceptance rate of 35%). In addition, the Program Committee decided to accept six other papers, considered as describing interesting ongoing research, in the form of short papers. The authors of these 25 papers came from 18 di?erent countries (Argentina, Australia, Brazil, Canada, Czech Republic, Chile, Colombia, Finland, France, Germany, Japan, Italy, Mexico, Saudi Arabia, Switzerland, Spain, United Kingdom, and USA).
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-45735-0
- 9783540457350
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.