String processing and information retrieval : 11th international conference, SPIRE 2004, Padova, Italy, october 5-8, 2004 : proceedings

Guardat en:
Dades bibliogràfiques
Autor principal: Apostolico, Alberto, 1948-
Autor corporatiu: Conference on String Processing and Information Retrieval (Autor)
Altres autors: Melucci, Massimo (Director editorial)
Format: Livre numérique
Idioma:Anglais
Publicat: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Col·lecció:Lecture notes in computer science 3246
Matèries:
Accés en línia:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Nota: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• String processing and information retrieval, 11th international conference, SPIRE 2004, Padova, Italy, october 5-8, 2004, proceedings, Alberto Apostolico, Massimo Melucci (eds.), Berlin, Springer, 2004, 1 vol. (XIV-332 p.), Lecture notes in computer science, 3-540-23210-9
• String Processing and Information Retrieval, Texte imprimé, 9783662178041
LEADER 05389nam a22004457a 4500
001 972580
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155226584
020 |a 9783540302131 (PDF) 
041 0 |a eng 
082 |a 004 
100 1 |a Apostolico, Alberto,  |d 1948- 
245 1 0 |a String processing and information retrieval :  |b 11th international conference, SPIRE 2004, Padova, Italy, october 5-8, 2004 : proceedings   |c [edited by] Alberto Apostolico, Massimo Melucci. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 3246  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a 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. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
650 |a Informatique 
650 |a Algorithmes 
650 |a Intelligence artificielle 
650 |a Systèmes d'information 
650 |a Codage 
650 |a Informatique documentaire 
650 |a Structures de données (informatique) 
650 |a Recherche documentaire automatisée 
650 |a Actes de congrès 
700 1 |a Melucci, Massimo.  |4 pbd 
711 2 |a Conference on String Processing and Information Retrieval  |n (11  |d  :2004  |c  :Padova, IT).  |4 aut 
776 0 |0 082297622  |t String processing and information retrieval  |o 11th international conference, SPIRE 2004, Padova, Italy, october 5-8, 2004  |o proceedings  |f Alberto Apostolico, Massimo Melucci (eds.)  |c Berlin  |n Springer  |d 2004  |p 1 vol. (XIV-332 p.)  |s Lecture notes in computer science  |z 3-540-23210-9 
776 0 |t String Processing and Information Retrieval  |b Texte imprimé  |z 9783662178041 
856 4 |q PDF  |u https://doi.org/10.1007/b100941  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-158BJG79-D  |z Accès sur la plateforme Istex 
856 4 |5 452349901:750635088  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b100941  |z Accès Université d'Orléans 
856 4 |5 180339901:753991330  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b100941  |z Accès INSA CVL 
997 |0 972580  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/