A low-cost neural sorting network with O(1) time complexity

Shun Shii Lin*, Shen Hsuan Hsu

*此作品的通信作者

研究成果: 雜誌貢獻期刊論文同行評審

5 引文 斯高帕斯(Scopus)

摘要

In this paper, we present an O(1) time neural network with O(n(1+ε)) neurons and links to sort n data, ε > O. For large-size problems, it is desirable to have low-cost hardware solutions. In order to solve the sorting problem in constant time and with less hardware-cost, we adopt Leighton's column sort [5] as the main architecture. Then we use Chen and Hsieh's neural network [3] with O(n3) complexity as the lowest-level sub-networks. By using recursive techniques properly, we are able to explore constant-time, low-complexity neural sorting networks.

原文英語
頁(從 - 到)289-299
頁數11
期刊Neurocomputing
14
發行號3
DOIs
出版狀態已發佈 - 1997 二月 28

ASJC Scopus subject areas

  • 電腦科學應用
  • 認知神經科學
  • 人工智慧

指紋

深入研究「A low-cost neural sorting network with O(1) time complexity」主題。共同形成了獨特的指紋。

引用此