String processing and information retrieval : 12th international conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005 : proceedings / Mariano Consens, Gonzalo Navarro (eds.).

By: (12th : SPIRE (Symposium) (12th : 2005 : Buenos Aires, Argentina)
Contributor(s): Consens, Mariano | Navarro, Gonzalo, 1969-
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 3772.Publisher: Berlin ; New York : Springer, ©2005Description: 1 online resource (ix, 406 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540322412; 3540322418; 3540297405; 9783540297406Other title: SPIRE 2005Subject(s): Text processing (Computer science) -- Congresses | Information storage and retrieval systems -- Congresses | Systèmes d'information -- Congrès | Traitement de texte -- Congrès | COMPUTERS -- Digital media -- Desktop Publishing | COMPUTERS -- Desktop Applications -- Word Processing | Informatique | Information storage and retrieval systems | Text processing (Computer science) | Bioinformatik | Dokumentverarbeitung | Information Retrieval | Information-Retrieval-System | Mustervergleich | Sprachverarbeitung | World Wide Web | ZeichenketteGenre/Form: Electronic books. | Conference papers and proceedings. | Buenos Aires (2005) | Kongress. Additional physical formats: Print version:: String processing and information retrieval.DDC classification: 005.52 LOC classification: QA76.9.T48 | S68 2005Other classification: 06.64 | 004 | DAT 825f | SS 4800 Online resources: Click here to access online
Contents:
String Processing and Information Retrieval 2005 -- Enhanced Byte Codes with Restricted Prefix Properties -- Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences -- Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups -- XML Retrieval with a Natural Language Interface -- Recommending Better Queries from Click-Through Data -- A Bilingual Linking Service for the Web -- Evaluating Hierarchical Clustering of Search Results -- Counting Suffix Arrays and Strings -- Towards Real-Time Suffix Tree Construction -- Rank-Sensitive Data Structures -- Cache-Conscious Collision Resolution in String Hash Tables -- Measuring the Difficulty of Distance-Based Indexing -- N-Gram Similarity and Distance -- Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces -- Classifying Sentences Using Induced Structure -- Counting Lumps in Word Space: Density as a Measure of Corpus Homogeneity -- Multi-label Text Categorization Using K-Nearest Neighbor Approach with M-Similarity -- Lydia: A System for Large-Scale News Analysis -- Composite Pattern Discovery for PCR Application -- Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array -- Linear Time Algorithm for the Generalised Longest Common Repeat Problem -- Application of Clustering Technique in Multiple Sequence Alignment -- Stemming Arabic Conjunctions and Prepositions -- XML Multimedia Retrieval -- Retrieval Status Values in Information Retrieval Evaluation -- A Generalization of the Method for Evaluation of Stemming Algorithms Based on Error Counting -- Necklace Swap Problem for Rhythmic Similarity Measures -- Faster Generation of Super Condensed Neighbourhoods Using Finite Automata -- Restricted Transposition Invariant Approximate String Matching Under Edit Distance -- Fast Plagiarism Detection System -- A Model for Information Retrieval Based on Possibilistic Networks -- Comparison of Representations of Multiple Evidence Using a Functional Framework for IR -- Deriving TF-IDF as a Fisher Kernel -- Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem -- Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty -- L 1 Pattern Matching Lower Bound -- Approximate Matching in the L??? Metric -- An Edit Distance Between RNA Stem-Loops -- A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison -- Normalized Similarity of RNA Sequences -- A Fast Algorithmic Technique for Comparing Large Phylogenetic Trees -- Practical and Optimal String Matching -- A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's -- A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

Print version record.

String Processing and Information Retrieval 2005 -- Enhanced Byte Codes with Restricted Prefix Properties -- Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences -- Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups -- XML Retrieval with a Natural Language Interface -- Recommending Better Queries from Click-Through Data -- A Bilingual Linking Service for the Web -- Evaluating Hierarchical Clustering of Search Results -- Counting Suffix Arrays and Strings -- Towards Real-Time Suffix Tree Construction -- Rank-Sensitive Data Structures -- Cache-Conscious Collision Resolution in String Hash Tables -- Measuring the Difficulty of Distance-Based Indexing -- N-Gram Similarity and Distance -- Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces -- Classifying Sentences Using Induced Structure -- Counting Lumps in Word Space: Density as a Measure of Corpus Homogeneity -- Multi-label Text Categorization Using K-Nearest Neighbor Approach with M-Similarity -- Lydia: A System for Large-Scale News Analysis -- Composite Pattern Discovery for PCR Application -- Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array -- Linear Time Algorithm for the Generalised Longest Common Repeat Problem -- Application of Clustering Technique in Multiple Sequence Alignment -- Stemming Arabic Conjunctions and Prepositions -- XML Multimedia Retrieval -- Retrieval Status Values in Information Retrieval Evaluation -- A Generalization of the Method for Evaluation of Stemming Algorithms Based on Error Counting -- Necklace Swap Problem for Rhythmic Similarity Measures -- Faster Generation of Super Condensed Neighbourhoods Using Finite Automata -- Restricted Transposition Invariant Approximate String Matching Under Edit Distance -- Fast Plagiarism Detection System -- A Model for Information Retrieval Based on Possibilistic Networks -- Comparison of Representations of Multiple Evidence Using a Functional Framework for IR -- Deriving TF-IDF as a Fisher Kernel -- Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem -- Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty -- L 1 Pattern Matching Lower Bound -- Approximate Matching in the L??? Metric -- An Edit Distance Between RNA Stem-Loops -- A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison -- Normalized Similarity of RNA Sequences -- A Fast Algorithmic Technique for Comparing Large Phylogenetic Trees -- Practical and Optimal String Matching -- A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's -- A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching.

There are no comments for this item.

to post a comment.

Powered by Koha