A nearest neighbor representation of a Boolean function is set positive and negative prototypes in Rn such that the has value 1 on an input iff closest prototype positive. For k-nearest majority classification k considered. The complexity minimal number needed to represent function. We give several bounds for this measure. Separations are given between cases when can be real or required Boolean...

A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., “find all my nearest gas stations during my route from point s to point e”). The result contains a set of tuples, such that point is the NN of all points in the corresponding interval. Existing methods for continuous nearest neighbor search are based on the repetitiv...