Hundreds of experiments over the last decade on the retrieval of OCR documents performed by the Information Science Research Institute have shown that OCR errors do not significantly affect retrievability. We extend those results to show that in the case of proximity searching, the removal of running headers and footers from OCR text will not improve retrievability for such searches.

Let X be an arrangement of n algebraic sets Xi in d-space, where the Xi are either parametrized or zero-sets of dimension 0 ≤ mi ≤ d − 1. We study a number of decompositions of d-space into connected regions in which the distance-squared function to X has certain invariances. Each region is contained in a single connected component of the complement of the bifurcation set B of the family of dis...

In order to retrieve best documents for finding answers, we developed a robust proximity search engine. It efficiently finds relevant passages. In addition, our search engine has two disjunction operators: or and or2. The former works just like addition, whereas the latter works just like logical disjunction. The operator or2 is used to introduce synonyms and antonyms of a query term. The searc...

In this paper, we propose a novel ICP variant that uses a histogram in conjunction with multiple closest points to detect the overlap area between range images geing registered. Tentative correspondences sharing similar distances are normally all within, or all outside, the overlap area. Thus, the overlap area can be detected in a bin by bin batch manner using a histogram. Using multiple closes...

Consider observation data, comprised of n observation vectors with values on a set of attributes. This gives us n points in attribute space. Having data structured as a tree, implied by having our observations embedded in an ultrametric topology, offers great advantage for proximity searching. If we have preprocessed data through such an embedding, then an observation’s nearest neighbor is foun...

Nowadays modern cars integrate advanced driving assistance systems which range up to fully automated driving modes. Since fully automated driving modes have not come into everyday practice yet, operators are currently making use of assistance systems. While still being in control of the vehicle, alerts signal possible collision dangers when, for example, parking. The reason for the necessity of...

Geometric Near-neighbor Access Tree (GNAT) is a metric space indexing method based on hierarchical hyperplane partitioning of the space. While GNAT is very efficient in proximity searching, it has a bad reputation of being a memory hog. We show that this is partially based on too coarse analysis, and that the memory requirements can be lowered while at the same time improving the search efficie...

We use household survey data from the UK to study how close ‘middle-aged’ men and women in partnerships live to their own parents and their partner’s parents. We find a slight tendency for couples to live closer to the woman’s parents than the man’s. This tendency is more pronounced among couples in which neither partner has a degree and in which there is a child. In other respects, proximity t...

This paper presents a new algorithm for real-time tracking of pairs of closest points as well as their corresponding surface features between certain general types of objects (which can be non-convex) with parametric curved surfaces. The fact that the algorithm works directly on accurate parametric descriptions of curved surfaces rather than polygonal approximation of surfaces (i.e., polygonal ...