1 option
String Processing and Information Retrieval : 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004. Proceedings / edited by Alberto Apostolico, Massimo Melucci.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 3246.
- Lecture Notes in Computer Science, 0302-9743 ; 3246
- Language:
- English
- Subjects (All):
- Data structures (Computer science).
- Information storage and retrieval.
- Artificial intelligence.
- Database management.
- Coding theory.
- Information theory.
- Data Structures and Information Theory.
- Information Storage and Retrieval.
- Artificial Intelligence.
- Database Management.
- Data Structures.
- Coding and Information Theory.
- Local Subjects:
- Data Structures and Information Theory.
- Information Storage and Retrieval.
- Artificial Intelligence.
- Database Management.
- Data Structures.
- Coding and Information Theory.
- Physical Description:
- 1 online resource (XIV, 334 pages).
- Edition:
- First edition 2004.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
- System Details:
- text file PDF
- Contents:
- Efficient One Dimensional Real Scaled Matching
- Linear Time Algorithm for the Longest Common Repeat Problem
- Automaton-Based Sublinear Keyword Pattern Matching
- Techniques for Efficient Query Expansion
- Inferring Query Performance Using Pre-retrieval Predictors
- A Scalable System for Identifying Co-derivative Documents
- Searching for a Set of Correlated Patterns
- Linear Nondeterministic Dawg String Matching Algorithm (Abstract)
- Permuted and Scaled String Matching
- Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS
- A New Feature Normalization Scheme Based on Eigenspace for Noisy Speech Recognition
- Fast Detection of Common Sequence Structure Patterns in RNAs
- An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem
- Automatic Document Categorization Based on k-NN and Object-Based Thesauri
- Indexing Text Documents Based on Topic Identification
- Cross-Comparison for Two-Dimensional Text Categorization
- DDOC: Overlapping Clustering of Words for Document Classification
- Evaluation of Web Page Representations by Content Through Clustering
- Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays
- Information Extraction by Embedding HMM to the Set of Induced Linguistic Features
- Finding Cross-Lingual Spelling Variants
- An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size
- An Alphabet-Friendly FM-Index
- Concurrency Control and I/O-Optimality in Bulk Insertion
- Processing Conjunctive and Phrase Queries with the Set-Based Model
- Metric Indexing for the Vector Model in Text Retrieval
- Negations and Document Length in Logical Retrieval
- An Improvement and an Extension on the Hybrid Index for Approximate String Matching
- First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index
- Metric Indexes for Approximate String Matching in a Dictionary
- Simple Implementation of String B-Trees
- Alphabet Permutation for Differentially Encoding Text
- A Space-Saving Linear-Time Algorithm for Grammar-Based Compression
- Simple, Fast, and Efficient Natural Language Adaptive Compression
- Searching XML Documents Using Relevance Propagation
- Dealing with Syntactic Variation Through a Locality-Based Approach
- Efficient Extraction of Structured Motifs Using Box-Links
- Efficient Computation of Balancedness in Binary Sequence Generators
- On Asymptotic Finite-State Error Repair
- New Algorithms for Finding Monad Patterns in DNA Sequences
- Motif Extraction from Weighted Sequences
- Longest Motifs with a Functionally Equivalent Central Block
- On the Transformation Distance Problem
- On Classification of Strings.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-30213-1
- 9783540302131
- 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.