String Processing and Information Retrieval - Edleno Moura
- Format: Broché Voir le descriptif
Vous en avez un à vendre ?
Vendez-le-vôtre80,87 €
Produit Neuf
Ou 20,22 € /mois
- Livraison à 0,01 €
- Livré entre le 25 juillet et le 6 août
Brand new, In English, Fast shipping from London, UK; Tout neuf, en anglais, expédition rapide depuis Londres, Royaume-Uni;ria9783319119175_dbm
Nos autres offres
-
82,34 €
Produit Neuf
Ou 20,59 € /mois
- Livraison : 3,99 €
- Livré entre le 24 et le 30 juillet
Voir le détail de l'annonce
- Payez directement sur Rakuten (CB, PayPal, 4xCB...)
- Récupérez le produit directement chez le vendeur
- Rakuten vous rembourse en cas de problème
Gratuit et sans engagement
Félicitations !
Nous sommes heureux de vous compter parmi nos membres du Club Rakuten !
TROUVER UN MAGASIN
Retour
Avis sur String Processing And Information Retrieval de Edleno Moura Format Broché - Livre
0 avis sur String Processing And Information Retrieval de Edleno Moura Format Broché - Livre
Les avis publiés font l'objet d'un contrôle automatisé de Rakuten.
Présentation String Processing And Information Retrieval de Edleno Moura Format Broché
- Livre
Résumé :
This book constitutes the proceedings of the 21st International Symposium on String Processing and Information Retrieval, SPIRE 2014, held in Ouro Preto, Brazil, in October 2014. The 20 full and 6 short papers included in this volume were carefully reviewed and selected from 45 submissions. The papers focus not only on fundamental algorithms in string processing and information retrieval, but address also application areas such as computational biology, Web mining and recommender systems. They are organized in topical sections on compression, indexing, genome and related topics, sequences and strings, search, as well as on mining and recommending.
Sommaire:
Compression.- Strategic Pattern Search in Factor-Compressed Test.- Relative Lempel-Ziv with Constant-Time Random Access.- Efficient Compressed Indexing for Approximate Top-k String Retrieval.- Grammar Compressed Sequences with Rank/Select Support.- Indexing.- Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings.- Relative FM-Indexes.- Efficient Indexing and Representation of Web Access Logs.- A Compressed Suffix-Array Strategy for Temporal-Graph Indexing.- Succinct Indexes for Reporting Discriminating and Generic Words.- Fast Construction of Wavelet Trees.- Order Preserving Prefix Tables.- Genome and Related Topics.- Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time.- A 3-Approximation Algorithm for the Multiple Spliced Alignment Problem and Its Application to the Gene Prediction Task.- Improved Filters for the Approximate Suffix-Prefix Overlap Problem.- Sequences and Strings Sequence Decision.- Diagrams.- Shortest Unique Queries on Strings.- Online Multiple Palindrome Pattern Matching.- Indexed Matching Statistics and Shortest Unique Substrings.- Search.- I/O-Efficient Dictionary Search with One Edit Error.- Online Pattern Matching for String Edit Distance with Moves.- K2-Treaps: Range Top-k Queries in Compact Space.- Performance Improvements for Search Systems Using an Integrated Cache of Lists + Intersections.- Mining and Recommending Information-Theoretic Term Selection for New Item Recommendation.- On the String Consensus Problem and the Manhattan Sequence Consensus Problem.- Context-Aware Deal Size Prediction.- Simple and Efficient String Algorithms for Query Suggestion Metrics Computation.
Détails de conformité du produit
Personne responsable dans l'UE