String Processing and Information Retrieval
Editat de Alberto H. F. Laender, Arlindo L. Oliveiraen Limba Engleză Paperback – 28 aug 2002
Preț: 324.03 lei
Preț vechi: 405.04 lei
-20% Nou
Puncte Express: 486
Preț estimativ în valută:
57.34€ • 67.33$ • 50.33£
57.34€ • 67.33$ • 50.33£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540441588
ISBN-10: 3540441581
Pagini: 356
Ilustrații: XII, 344 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540441581
Pagini: 356
Ilustrații: XII, 344 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras