Learn More
We consider range queries that search for low-frequency elements (least frequent elements and $$\alpha $$ α -minorities) in arrays. An $$\alpha $$ α -minority of a query range has multiplicity no greater than an $$\alpha $$ α fraction of the elements in the range. Our data structure for the least frequent element range query problem requires $$O(n)$$ O ( n(More)
Given an array A of size n, we consider the problem of answering range majority queries: given a query range [i..j] where 1 ≤ i ≤ j ≤ n, return the majority element of the subarray A[i..j] if it exists. We describe a linear space data structure that answers range majority queries in constant time. We further generalize this problem by defining range(More)
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a permutation naming the closest site, the second-closest, and so on. We examine how many distinct permutations can occur as a function of the number of sites and the size of the(More)
An artificial neural network model for the recognition of Escherichia coli O157:H7 restriction patterns was designed. In the training phase, images of two classes of E. coli isolates (O157:H7 and non-O157:H7) were digitized and transmitted to the neural network. The system was then tested for recognition of images not included in the training set. Promising(More)
We present $$O(n)$$ O ( n ) -space data structures to support various range frequency queries on a given array $$A[0:n-1]$$ A [ 0 : n - 1 ] or tree $$T$$ T with $$n$$ n nodes. Given a query consisting of an arbitrary pair of pre-order rank indices $$(i,j)$$ ( i , j ) , our data structures return a least frequent element, mode, $$\alpha $$ α -minority, or(More)
We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search performance for data with more inherent sortedness. Given n points in the plane, it can answer range queries in O(k log n+m) time, where m is the number of points in the output and k is the(More)
Constructing an encoding of a concept lattice using short bit vectors allows for efficient computation of join operations on the lattice. Join is the central operation any unification-based parser must support. We extend the traditional bit vector encoding , which represents join failure using the zero vector, to count any vector with less than a fixed(More)