The polygon retrieval problem on points is the problem of preprocessing a set of n points on the plane, so that given a polygon query, the subset of points lying inside it can be reported efficiently. It is of great interest in areas such as Computer Graphics, CAD applications, Spatial Databases and GIS developing tasks. In this paper we study the problem of canonical k-vertex polygon queries o...

Web mail search is an emerging topic, which has not been the object of as many studies as traditional Web search. In particular, little is known about the characteristics of mail searchers and of the queries they issue. We study here the characteristics of Web mail searchers, and explore how demographic signals such as location, age, gender, and inferred income, influence their search behavior....

While it is known that academic searchers differ from typical web searchers, little is known about the search behavior of academic searchers over longer periods of time. In this study we take a look at academic searchers through a large-scale log analysis on a major academic search engine. We focus on two aspects: query reformulation patterns and topic shifts in queries. We first analyze how ea...

Memory checking studies the problem of cryptographically verifying the correctness of untrusted indexed storage. After a series of results yielding checkers with O(log n) query complexity, Dwork, Naor, Ruthblum and Vaikuntanathan [9] derived an Ω(log n/ log logn) lower bound on the query complexity of any checker operating on memory words of polylogarithmic size, where n is the number of memory...

Let s be a point in a polygonal domain P of h−1 holes and n vertices. We consider the following quickest visibility query problem. Given a query point q in P, the goal is to find a shortest path in P to move from s to see q as quickly as possible. Previously, Arkin et al. (SoCG 2015) built a data structure of size O(n22α(n) logn) that can answer each query in O(K log2 n) time, where α(n) is the...

Instant search is a new search paradigm that shows results as a user types in a query. It has become increasingly popular in recent years due to its simplicity and power. In an instantsearch system, every keystroke from a user triggers a new request to the server. Therefore, its log has a richer content than that of a traditional search system, and previous log analysis research is not applicab...

We present an O( √ N) discrete query quantum algorithm for evaluating balanced binary NAND formulas and an O(N 1 2 +O( 1 √ log N ) ) discrete query quantum algorithm for evaluating arbitrary binary NAND formulas.

This is perhaps one of the most fundamental data structure problems. When the values of A[1, . . . , n] are drawn from a semigroup, its static version (where updates are not allowed) has the famous inverse-Ackermann Θ(α(n)) query bound with linear storage [4]; the dynamic version can be easily solved by a binary tree in O(log n) time per operation, and a corresponding Ω(log n) lower bound was p...

The dictionary matching with gaps problem is to preprocess a dictionary D of d gapped patterns P1, . . . , Pd over alphabet Σ, where each gapped pattern Pi is a sequence of subpatterns separated by bounded sequences of don’t cares. Then, given a query text T of length n over alphabet Σ, the goal is to output all locations in T in which a pattern Pi ∈ D, 1 ≤ i ≤ d, ends. There is a renewed curre...