Info
ESAIR'11 : proceedings of the fourth Workshop on Exploiting Semantic Annotations in Information Retrieval, October 28, 2011, Glasgow, Scotland, UK
| ESAIR'11 : proceedings of the fourth Workshop on Exploiting Semantic Annotations in Information Retrieval, October 28, 2011, Glasgow, Scotland, UK |
| Autore | Alonso Omar |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2011 |
| Descrizione fisica | 1 online resource (30 pages) |
| Collana | ACM Conferences |
| Soggetto topico |
Engineering & Applied Sciences
Computer Science |
| ISBN | 1-4503-0958-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti |
Exploiting Semantic Annotations in Information Retrieval'11
Proceedings of the fourth Workshop on Exploiting Semantic Annotations in Information Retrieval |
| Record Nr. | UNINA-9910376128303321 |
Alonso Omar
|
||
| [Place of publication not identified], : ACM, 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
String Processing and Information Retrieval [[electronic resource] ] : 16th International Symposium, SPIRE 2009 Saariselkä, Finland, August 25-27, 2009 Proceedings / / edited by Jussi Karlgren, Jorma Tarhio, Heikki Hyyrö
| String Processing and Information Retrieval [[electronic resource] ] : 16th International Symposium, SPIRE 2009 Saariselkä, Finland, August 25-27, 2009 Proceedings / / edited by Jussi Karlgren, Jorma Tarhio, Heikki Hyyrö |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XIII, 354 p.) |
| Disciplina | 005.52 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Information storage and retrieval systems
Computer programming Data mining Artificial intelligence—Data processing Data structures (Computer science) Information theory Computer science—Mathematics Information Storage and Retrieval Programming Techniques Data Mining and Knowledge Discovery Data Science Data Structures and Information Theory Symbolic and Algebraic Manipulation |
| ISBN | 3-642-03784-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms on Trees -- Range Quantile Queries: Another Virtue of Wavelet Trees -- Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees -- k2-Trees for Compact Web Graph Representation -- On-Line Construction of Parameterized Suffix Trees -- Compressed Indexes -- Succinct Text Indexing with Wildcards -- A Compressed Enhanced Suffix Array Supporting Fast String Matching -- Compressed Suffix Arrays for Massive Data -- On Entropy-Compressed Text Indexing in External Memory -- Compression -- A Linear-Time Burrows-Wheeler Transform Using Induced Sorting -- Novel and Generalized Sort-Based Transform for Lossless Data Compression -- A Two-Level Structure for Compressing Aligned Bitexts -- Directly Addressable Variable-Length Codes -- Content Analysis -- Identifying the Intent of a User Query Using Support Vector Machines -- Syntactic Query Models for Restatement Retrieval -- Use of Co-occurrences for Temporal Expressions Annotation -- On-Demand Associative Cross-Language Information Retrieval -- A Comparison of Data-Driven Automatic Syllabification Methods -- Indexing -- Efficient Index for Retrieving Top-k Most Frequent Documents -- Fast Single-Pass Construction of a Half-Inverted Index -- Two-Dimensional Distributed Inverted Files -- Indexing Variable Length Substrings for Exact and Approximate Matching -- String Algorithms and Bioinformatics -- Expectation of Strings with Mismatches under Markov Chain Distribution -- Consensus Optimizing Both Distance Sum and Radius -- Faster Algorithms for Sampling and Counting Biological Sequences -- String Algorithms and Theory I -- Towards a Theory of Patches -- The Frequent Items Problem, under Polynomial Decay, in the Streaming Model -- Improved Approximation Results on the Shortest Common Supersequence Problem -- String Algorithms and Theory II -- Set Intersection and Sequence Matching -- Generalised Matching -- Practical Algorithms for the Longest Common Extension Problem -- Using and Understanding Usage -- A Last-Resort Semantic Cache for Web Queries -- A Task-Based Evaluation of an Aggregated Search Interface -- Efficient Language-Independent Retrieval of Printed Documents without OCR -- Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems. |
| Record Nr. | UNISA-996465284803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
String processing and information retrieval : 16th international symposium, SPIRE 2009, Saariselka, Finland, August 25-27, 2009 : proceedings / / Jussi Karlgren, Jorma Tarhio, Heikki Hyyro (eds.)
| String processing and information retrieval : 16th international symposium, SPIRE 2009, Saariselka, Finland, August 25-27, 2009 : proceedings / / Jussi Karlgren, Jorma Tarhio, Heikki Hyyro (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XIII, 354 p.) |
| Disciplina | 005.52 |
| Altri autori (Persone) |
KarlgrenJussi
TarhioJorma HyyroHeikki |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Text processing (Computer science)
Information storage and retrieval systems |
| ISBN | 3-642-03784-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms on Trees -- Range Quantile Queries: Another Virtue of Wavelet Trees -- Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees -- k2-Trees for Compact Web Graph Representation -- On-Line Construction of Parameterized Suffix Trees -- Compressed Indexes -- Succinct Text Indexing with Wildcards -- A Compressed Enhanced Suffix Array Supporting Fast String Matching -- Compressed Suffix Arrays for Massive Data -- On Entropy-Compressed Text Indexing in External Memory -- Compression -- A Linear-Time Burrows-Wheeler Transform Using Induced Sorting -- Novel and Generalized Sort-Based Transform for Lossless Data Compression -- A Two-Level Structure for Compressing Aligned Bitexts -- Directly Addressable Variable-Length Codes -- Content Analysis -- Identifying the Intent of a User Query Using Support Vector Machines -- Syntactic Query Models for Restatement Retrieval -- Use of Co-occurrences for Temporal Expressions Annotation -- On-Demand Associative Cross-Language Information Retrieval -- A Comparison of Data-Driven Automatic Syllabification Methods -- Indexing -- Efficient Index for Retrieving Top-k Most Frequent Documents -- Fast Single-Pass Construction of a Half-Inverted Index -- Two-Dimensional Distributed Inverted Files -- Indexing Variable Length Substrings for Exact and Approximate Matching -- String Algorithms and Bioinformatics -- Expectation of Strings with Mismatches under Markov Chain Distribution -- Consensus Optimizing Both Distance Sum and Radius -- Faster Algorithms for Sampling and Counting Biological Sequences -- String Algorithms and Theory I -- Towards a Theory of Patches -- The Frequent Items Problem, under Polynomial Decay, in the Streaming Model -- Improved Approximation Results on the Shortest Common Supersequence Problem -- String Algorithms and Theory II -- Set Intersection and Sequence Matching -- Generalised Matching -- Practical Algorithms for the Longest Common Extension Problem -- Using and Understanding Usage -- A Last-Resort Semantic Cache for Web Queries -- A Task-Based Evaluation of an Aggregated Search Interface -- Efficient Language-Independent Retrieval of Printed Documents without OCR -- Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems. |
| Altri titoli varianti | SPIRE 2009 |
| Record Nr. | UNINA-9910483578003321 |
| Berlin, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||