| 摘要 |
An efficient method of searching large databases for pattern recognition is provided. The techniques disclosed illustrate how a large database of arbitrary binary data might be searched at high speed using fuzzy pattern recognition methods. Pattern recognition speed enhancements are derived from a strategy utilizing effective computational decomposition, multiple processing units, effective time-slot utilization, and an organizational approach that provides a method of performance improvement through effective aggregation. In a preferred technique, a pattern recognition system would utilize multiple processing units to achieve an almost arbitrarily scalable level of pattern recognition processing performance.
|
