The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples into a prede ned set of categories. These two applications are investigated under real-time constraints, when the deadlines imposed can dramatically alter the quality of the solution unless a parallel model of computatio...

This paper presents a novel approach for accelerating the popular Reciprocal Nearest Neighbors (RNN) clustering algorithm, i.e. the fast-RNN. We speed up the nearest neighbor chains construction via a novel dynamic slicing strategy for the projection search paradigm. We detail an efficient implementation of the clustering algorithm along with a novel data structure, and present extensive experi...

Previous work shows that candidates receive more personal votes, frequently called “friends-and-neighbors” votes, in areas where they have local attachments. This article examines heterogeneity in friends-and-neighbors voting near candidates’ counties of birth and residence in U.S. statewide executive office elections. Using two large datasets, I estimate how the magnitude of the friends-and-ne...