Computing nearest neighbors in real time

Marius Nagy

doi:10.1016/j.jpdc.2005.07.002

Computing nearest neighbors in real time

2006-03-01

0

OA

AI

DOI：10.1016/j.jpdc.2005.07.002

原文链接

查看原文

摘要

En 中文

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 predefined 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 computation (in these cases, a linear array of processors) is used. We also study a class of real-time computations, referred to as reactive real-time systems, that are particularly sensitive to the first time constraint imposed. (C) 2005 Elsevier Inc. All rights reserved.

Keyword:

parallel computation

nearest neighbor

real time

reactive systems

Computing nearest neighbors in real time

摘要

AI总结

期刊

机构

引用论文