top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
ICTIR 2013 : International Conference on the Theory of Information Retrieval, 29 September - 2 October 2013, Copenhagen, Denmark
ICTIR 2013 : International Conference on the Theory of Information Retrieval, 29 September - 2 October 2013, Copenhagen, Denmark
Autore Kurland Oren
Pubbl/distr/stampa [Place of publication not identified], : ACM, 2013
Descrizione fisica 1 online resource (148 pages)
Collana ACM Other conferences
Soggetto topico Social Sciences
Library & Information Science
ISBN 1-4503-2107-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Altri titoli varianti International Conference on the Theory of Information Retrieval 2013
Proceedings of the 2013 Conference on the Theory of Information Retrieval
ICTIR '13
International Conference on the Theory of Information Retrieval, Copenhagen, Denmark - September 29 - October 02, 2013
Record Nr. UNINA-9910375722903321
Kurland Oren  
[Place of publication not identified], : ACM, 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
String Processing and Information Retrieval [[electronic resource] ] : 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings / / edited by Oren Kurland, Moshe Lewenstein, Ely Porat
String Processing and Information Retrieval [[electronic resource] ] : 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings / / edited by Oren Kurland, Moshe Lewenstein, Ely Porat
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (XII, 312 p. 62 illus.)
Disciplina 005.52
Collana Theoretical Computer Science and General Issues
Soggetto topico Information storage and retrieval systems
Pattern recognition systems
Algorithms
Data mining
Information Storage and Retrieval
Automated Pattern Recognition
Data Mining and Knowledge Discovery
ISBN 3-319-02432-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Consolidating and Exploring information via Textual Inference -- Pattern Discovery and Listing in Graphs -- Efficient Approximation of Edit Distance -- Nowcasting with Google Trends -- Space-efficient Construction of the Burrows-Wheeler Transform -- Using Mutual Inuence to Improve Recommendations -- Position-Restricted Substring Searching Over Small Alphabets -- Simulation Study of Multi-threading in Web Search Engine Processors -- Query Processing in Highly-Loaded Search Engines -- Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs -- Adaptive Data Structures for Permutations and Binary Relations -- Document Listing on Versioned Documents -- Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes -- Compact Querieable Representations of Raster Data -- Top-k Color Queries On Tree Paths -- A Lempel-Ziv Compressed Structure for Document Listing -- Minimal Discriminating Words Problem Revisited -- Adding Compression and Blended Search to a Compact Two-Level Suffix Array -- You are what you eat: learning user tastes for rating prediction -- Discovering dense subgraphs in parallel for compressing Web and Social networks -- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text -- Lossless compression of rotated maskless lithography images -- Learning URL Normalization Rules using Multiple Alignment of Sequences -- On Two-Dimensional Lyndon Words -- Fully-Online Grammar Compression -- Solving Graph Isomorphism using Parameterized Matching -- Suffix Array of Alignment: A Practical Index for Similar Data -- Faster Top-k Document Retrieval in Optimal Space -- Faster Range LCP Queries -- Learning to Schedule Webpage Updates Using Genetic Programming -- Accurate Profiling of Microbial Communities from Massively Parallel Sequencing using Convex Optimization -- Distributed Query Processing on Compressed Graphs using K2-Trees.
Record Nr. UNISA-996466028503316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
String Processing and Information Retrieval [[electronic resource] ] : 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings / / edited by Oren Kurland, Moshe Lewenstein, Ely Porat
String Processing and Information Retrieval [[electronic resource] ] : 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings / / edited by Oren Kurland, Moshe Lewenstein, Ely Porat
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (XII, 312 p. 62 illus.)
Disciplina 005.52
Collana Theoretical Computer Science and General Issues
Soggetto topico Information storage and retrieval systems
Pattern recognition systems
Algorithms
Data mining
Information Storage and Retrieval
Automated Pattern Recognition
Data Mining and Knowledge Discovery
ISBN 3-319-02432-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Consolidating and Exploring information via Textual Inference -- Pattern Discovery and Listing in Graphs -- Efficient Approximation of Edit Distance -- Nowcasting with Google Trends -- Space-efficient Construction of the Burrows-Wheeler Transform -- Using Mutual Inuence to Improve Recommendations -- Position-Restricted Substring Searching Over Small Alphabets -- Simulation Study of Multi-threading in Web Search Engine Processors -- Query Processing in Highly-Loaded Search Engines -- Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs -- Adaptive Data Structures for Permutations and Binary Relations -- Document Listing on Versioned Documents -- Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes -- Compact Querieable Representations of Raster Data -- Top-k Color Queries On Tree Paths -- A Lempel-Ziv Compressed Structure for Document Listing -- Minimal Discriminating Words Problem Revisited -- Adding Compression and Blended Search to a Compact Two-Level Suffix Array -- You are what you eat: learning user tastes for rating prediction -- Discovering dense subgraphs in parallel for compressing Web and Social networks -- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text -- Lossless compression of rotated maskless lithography images -- Learning URL Normalization Rules using Multiple Alignment of Sequences -- On Two-Dimensional Lyndon Words -- Fully-Online Grammar Compression -- Solving Graph Isomorphism using Parameterized Matching -- Suffix Array of Alignment: A Practical Index for Similar Data -- Faster Top-k Document Retrieval in Optimal Space -- Faster Range LCP Queries -- Learning to Schedule Webpage Updates Using Genetic Programming -- Accurate Profiling of Microbial Communities from Massively Parallel Sequencing using Convex Optimization -- Distributed Query Processing on Compressed Graphs using K2-Trees.
Record Nr. UNINA-9910484682303321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui