#### Filter Results:

#### Publication Year

1998

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

#### Cell Type

Learn More

- Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison +2 others
- Inf. Process. Lett.
- 2008

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)

Long-distance cell migration is an important feature of embryonic development, adult morphogenesis and cancer, yet the mechanisms that drive subpopulations of cells to distinct targets are poorly understood. Here, we use the embryonic neural crest (NC) in tandem with theoretical studies to evaluate model mechanisms of long-distance cell migration. We find… (More)

A space-efficient 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. We describe four space-efficient algorithms for computing the convex hull of a planar point set.

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)

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)

- Thomas Wicker, Jon S Robertson, Stefan R Schulze, F Alex Feltus, Vincent Magrini, Thomas Wicker +8 others
- 2016

The repetitive landscape of the chicken genome.

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.. .

We consider the problem of translating a (finite or infinite) square grid G over a set S of n points in the plane in order to maximize some objective function. We say that a grid cell is k-occupied if it contains k or more points of S. The main set of problems we study have to do with translating an infinite grid so that the number of k-occupied cells is… (More)

This paper presents a systematic approach to co-evolution that allows concise and uniied expression of all types of symbiotic relationships studied in ecology. The resulting Linear Model of Symbiosis can be easily added to any regular Genetic Algorithm. Our model helps prevent premature convergence to a local optimum by maintaining the genetic diversity in… (More)