Learn More
Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom analyzed the probability of such erroneous answers, called the false-positive rate, and Bloom's analysis has appeared in many publications throughout the years. We show that(More)
A mode of a multiset S is an element a∈S of maximum multiplicity; that is, a occurs at least as frequently as any other element in S. Given an array A[1:n] of n elements, we consider a basic problem: constructing a static data structure that efficiently answers range mode queries on A. Each query consists of an input pair of indices (i,j) for which a mode(More)
BACKGROUND Local Ontario Early Years Centres (OEYCs) collect timely and relevant local data, but knowledge translation is needed for the data to be useful. Maps represent an ideal tool to interpret local data. While geographic information system (GIS) technology is available, it is less clear what users require from this technology for evidence-informed(More)
Security is an independent , non-profit center created in 1987 to do research and policy analysis in the areas of environment, sustainable development, and international security. Underlying all of the Insti-tute's work is the recognition that the pressing problems of environmental degradation, regional and global poverty, and political tension and conflict(More)
We develop a number of space-efficient tools including an approach to simulate divide-and-conquer space-efficiently, stably selecting and unselecting a subset from a sorted set, and computing the kth smallest element in one dimension from a multi-dimensional set that is sorted in another dimension. We then apply these tools to solve several geometric(More)
An in-place algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. In this paper we describe three in-place algorithms for computing the convex hull of a planar point set. All three algorithms are optimal, some more so than others.. .