Computing Nearest Neighbors in Real Time*

M. Nagy and S.G. Akl (Canada)


: parallel computation, nearest neighbor, real time, reactive systems.


The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmit ted over noisy communication channels or to classify sam ples into a predefined set of categories. These two applica tions are investigated under real-time constraints, when the deadlines imposed can dramatically alter the quality of the solution unless a parallel model of computation (in these cases, a linear array of processors) is used. We also study a class of real-time computations, re ferred to as reactive real-time systems, that are particularly sensitive to the first time constraint imposed.

Important Links:

Go Back