For various lattice gas models with nearest neighbour exclusion (and, in one case, second-nearest neighbour exclusion as well), we obtain lower bounds on m, the average number of particles on the non-excluded lattice sites closest ∗We dedicate this work to the memory of Ann Stell, beloved friend of OP and beloved wife of GS.

This paper presents a non parametric method for classifying interactions between two people as taken from a video camera. A nearest neighbour classifier that uses trajectory matching in feature space is introduced and shown to be superior to regular nearest neighbour classification for this problem.

We study a constrained version of the knapsack problem in which dependencies between items are given by the adjacencies of a graph. In the 1-neighbour knapsack problem, an item can be selected only if at least one of its neighbours is also selected. We give approximation algorithms and hardness results when the nodes have both uniform and arbitrary weight and profit functions, and when the depe...

Nearest Neighbour algorithms for pattern recognition have been widely studied. It is now well-established that they offer a quick and reliable method of data classification. In this paper we further develop the basic definition of the standard k-nearest neighbour algorithm to include the ability to resolve conflicts when the highest number of nearest neighbours are found for more than one train...

Competition is a key feature that structures the composition of plant communities. A growing body of evidence is showing that the presence of neighbours, especially belowground neighbours, induces varied morphological responses in plants. However, in many species, it is not known whether neighbour identity also influences plant morphological responses such as biomass allocation patterns. To ass...