At present, three problems exist in searchable encryption cloud storage services: firstly, most traditional schemes only support single-keyword search while fail to perform Boolean searches; even if a few searching, the efficiency is also unsatisfactory. Secondly, existing do not dynamic keyword updates, so update low. Thirdly, cannot meet all demands of users, rankable searching over files acc...

Color (or categorical) range reporting is a variant of the orthogonal range reporting problem in which every point in the input is assigned a color. While the answer to an orthogonal point reporting query contains all points in the query range Q, the answer to a color reporting query contains only distinct colors of points in Q. In this paper we describe an O(N)-space data structure that answer...

A Source code 2 A.1 Tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 A.2 Searchers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 A.2.1 search tree.hpp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 A.2.2 selection search tree.hpp . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

Abelian string matching problems are becoming an object of considerable interest in last years. Very recently, Alatabbi et al. [1] presented the first solution for the longest common Abelian factor problem for a pair of strings, reaching O(σn) time with O(σn log n) bits of space, where n is the length of the strings and σ is the alphabet size. In this note we show how the time complexity can be...

The “sum and difference covering set” (SDCS) is a steganographic technique which provides high embedding efficiency. In this paper, we implement SDCS in image steganography by searching an appropriate SDCS for high embedding efficiency and low complexity. Thus the contamination in smooth areas of image is evident for steganalyzer, we propose a novel content-adaptive steganographic scheme based ...

This paper examines the standard string-matching approach to automated score following of an acoustic performance, looking at limitations imposed by both the score representation used and the matching approach. The approach is then extended through the incorporation of duration information and matchscores based on a model of transcriber error. The resulting score follower promises to allow comp...

In substring compression one is given a text to preprocess so that, upon request, a compressed substring is returned. Generalized substring compression is the same with the following twist. The queries contain an additional context substring (or a collection of context substrings) and the answers are the substring in compressed format, where the context substring is used to make the compression...

We study the problem of 2-dimensional orthogonal range counting with additive error. Given a set P of n points drawn from an n× n grid and an error parameter ε, the goal is to build a data structure, such that for any orthogonal range R, the data structure can return the number of points in P ∩ R with additive error εn. A well-known solution for this problem is the εapproximation. Informally sp...

We consider a variant of the orthogonal range reporting problem when all points should be reported in the sorted order of their x-coordinates. We show that reporting two-dimensional points with this additional condition can be organized (almost) as efficiently as the standard range reporting. Moreover, our results generalize and improve the previously known results for the orthogonal range succ...