Titlebook: String Processing and Information Retrieval; 20th International S Oren Kurland,Moshe Lewenstein,Ely Porat Conference proceedings 2013 Sprin

善于骗人

anticipate

Space-Efficient Construction of the Burrows-Wheeler Transform,e many problems in bioinformatics. However, the memory requirement during the construction of the . is often the bottleneck in applications in the bioinformatics domain..In this paper, we present a linear-time semi-external algorithm whose memory requirement is only about one byte per input symbol.

漂亮才会豪华

Using Mutual Influence to Improve Recommendations,he way we model mutual influence is cheap and can be computed without requiring any source of content information about either items or users. We propose an algorithm that considers mutual influence to generate recommendations and analyse it over different recommendation datasets. We compare our alg

率直

Position-Restricted Substring Searching over Small Alphabets,cted substring searching queries. The query input consists of a pattern . (of length .) and two indices ℓ and . and the output is the set of all . . occurrences of . in .[ℓ....]. In this paper, we propose an .(.log.)-word space index with .(. + . .loglog.) query time. Our solution is interesting whe

COM

蔓藤图饰

Query Processing in Highly-Loaded Search Engines, computing infrastructure. We study how response times and results vary when, in presence of high loads, some queries are either interrupted after a fixed time threshold elapses or dropped completely. Moreover, we introduce a novel dropping strategy, based on machine learned performance predictors t

Yourself

悲痛

Adaptive Data Structures for Permutations and Binary Relations, general information theoretic lower bound, while achieving reasonable space complexities in the worst case. Our approach is derived from a geometric data structure [Arroyuelo et al., TCS 2011]. When used for representing permutations, it converges to a previously known adaptive representation [Barb

不要不诚实

Document Listing on Versioned Documents, for an exact substring and retrieve the documents that contain the substring. This problem is called ...We present an index for the document listing problem on versioned documents. Our index is the first one based on grammar-compression. This allows for good results on repetitive collections, where

hematuria