String Processing and Information Retrieval: 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings: Lecture Notes in Computer Science, cartea 4209
Editat de Fabio Crestani, Paolo Ferragina, Mark Sandersonen Limba Engleză Paperback – 29 sep 2006
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 337.85 lei
Preț vechi: 422.31 lei
-20% Nou
Puncte Express: 507
Preț estimativ în valută:
64.65€ • 67.67$ • 53.81£
64.65€ • 67.67$ • 53.81£
Carte tipărită la comandă
Livrare economică 31 martie-14 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540457749
ISBN-10: 3540457747
Pagini: 388
Ilustrații: XIV, 370 p.
Dimensiuni: 152 x 229 x 20 mm
Greutate: 0.57 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540457747
Pagini: 388
Ilustrații: XIV, 370 p.
Dimensiuni: 152 x 229 x 20 mm
Greutate: 0.57 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Web Clustering and Text Categorization.- MP-Boost: A Multiple-Pivot Boosting Algorithm and Its Application to Text Categorization.- TreeBoost.MH: A Boosting Algorithm for Multi-label Hierarchical Text Categorization.- Cluster Generation and Cluster Labelling for Web Snippets: A Fast and Accurate Hierarchical Solution.- Principal Components for Automatic Term Hierarchy Building.- Strings.- Computing the Minimum Approximate ?-Cover of a String.- Sparse Directed Acyclic Word Graphs.- On-Line Repetition Detection.- User Behavior.- Analyzing User Behavior to Rank Desktop Items.- The Intention Behind Web Queries.- Web Search Algorithms.- Compact Features for Detection of Near-Duplicates in Distributed Retrieval.- Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory.- Efficient Lazy Algorithms for Minimal-Interval Semantics.- Output-Sensitive Autocompletion Search.- Compression.- A Compressed Self-index Using a Ziv-Lempel Dictionary.- Mapping Words into Codewords on PPM.- Correction.- Improving Usability Through Password-Corrective Hashing.- Word-Based Correction for Retrieval of Arabic OCR Degraded Documents.- Information Retrieval Applications.- A Statistical Model of Query Log Generation.- Using String Comparison in Context for Improved Relevance Feedback in Different Text Media.- A Multiple Criteria Approach for Information Retrieval.- English to Persian Transliteration.- Bio Informatics.- Efficient Algorithms for Pattern Matching with General Gaps and Character Classes.- Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions.- How to Compare Arc-Annotated Sequences: The Alignment Hierarchy.- Web Search Engines.- Structured Index Organizations for High-Throughput Text Querying.- Adaptive Query-Based Sampling of DistributedCollections.- Short Papers.- Dotted Suffix Trees A Structure for Approximate Text Indexing.- Phrase-Based Pattern Matching in Compressed Text.- Discovering Context-Topic Rules in Search Engine Logs.- Incremental Aggregation of Latent Semantics Using a Graph-Based Energy Model.- A New Algorithm for Fast All-Against-All Substring Matching.