000 | 05262nam a22006855i 4500 | ||
---|---|---|---|
001 | 978-3-540-30213-1 | ||
003 | DE-He213 | ||
005 | 20240423130225.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2004 gw | s |||| 0|eng d | ||
020 |
_a9783540302131 _9978-3-540-30213-1 |
||
024 | 7 |
_a10.1007/b100941 _2doi |
|
050 | 4 | _aQA76.9.D35 | |
050 | 4 | _aQ350-390 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aGPF _2bicssc |
|
072 | 7 |
_aCOM021000 _2bisacsh |
|
072 | 7 |
_aUMB _2thema |
|
072 | 7 |
_aGPF _2thema |
|
082 | 0 | 4 |
_a005.73 _223 |
082 | 0 | 4 |
_a003.54 _223 |
245 | 1 | 0 |
_aString Processing and Information Retrieval _h[electronic resource] : _b11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004. Proceedings / _cedited by Alberto Apostolico, Massimo Melucci. |
250 | _a1st ed. 2004. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2004. |
|
300 |
_aXIV, 334 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v3246 |
|
505 | 0 | _aEfficient 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. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aInformation theory. | |
650 | 0 | _aInformation storage and retrieval systems. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aDatabase management. | |
650 | 0 |
_aArtificial intelligence _xData processing. |
|
650 | 0 | _aCoding theory. | |
650 | 1 | 4 | _aData Structures and Information Theory. |
650 | 2 | 4 | _aInformation Storage and Retrieval. |
650 | 2 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aDatabase Management. |
650 | 2 | 4 | _aData Science. |
650 | 2 | 4 | _aCoding and Information Theory. |
700 | 1 |
_aApostolico, Alberto. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aMelucci, Massimo. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540232100 |
776 | 0 | 8 |
_iPrinted edition: _z9783662178041 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v3246 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b100941 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c186350 _d186350 |