Book Volume 8214 2013

String Processing and Information Retrieval

20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings


ISBN: 978-3-319-02431-8 (Print) 978-3-319-02432-5 (Online)

Table of contents (32 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Chapter

    Pages 1-1

    Consolidating and Exploring Information via Textual Inference

  3. Chapter

    Pages 2-2

    Pattern Discovery and Listing in Graphs

  4. Chapter

    Pages 3-3

    Efficient Approximation of Edit Distance

  5. Chapter

    Pages 4-4

    Nowcasting with Google Trends

  6. Chapter

    Pages 5-16

    Space-Efficient Construction of the Burrows-Wheeler Transform

  7. Chapter

    Pages 17-28

    Using Mutual Influence to Improve Recommendations

  8. Chapter

    Pages 29-36

    Position-Restricted Substring Searching over Small Alphabets

  9. Chapter

    Pages 37-48

    Simulation Study of Multi-threading in Web Search Engine Processors

  10. Chapter

    Pages 49-55

    Query Processing in Highly-Loaded Search Engines

  11. Chapter

    Pages 56-63

    Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs

  12. Chapter

    Pages 64-71

    Adaptive Data Structures for Permutations and Binary Relations

  13. Chapter

    Pages 72-83

    Document Listing on Versioned Documents

  14. Chapter

    Pages 84-95

    Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes

  15. Chapter

    Pages 96-108

    Compact Querieable Representations of Raster Data

  16. Chapter

    Pages 109-115

    Top-k Color Queries on Tree Paths

  17. Chapter

    Pages 116-128

    A Lempel-Ziv Compressed Structure for Document Listing

  18. Chapter

    Pages 129-140

    Minimal Discriminating Words Problem Revisited

  19. Chapter

    Pages 141-152

    Adding Compression and Blended Search to a Compact Two-Level Suffix Array

  20. Chapter

    Pages 153-164

    You Are What You Eat: Learning User Tastes for Rating Prediction

  21. Chapter

    Pages 165-173

    Discovering Dense Subgraphs in Parallel for Compressing Web and Social Networks

previous Page of 2