Skip to search formSkip to main contentSkip to account menu

ASR-complete

ASR-complete is, by analogy to "NP-completeness" in complexity theory, a term to indicate that the difficulty of a computational problem is… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Self representation problem is very important for the negative selection algorithms. In this paper, two methods, named as K-NN… 
2011
2011
We describe an architecture that gives a robot the capability to recognize speech by cancelling ego noise, even while the robot… 
2011
2011
dr Ismail Tas, Konya Universitesi Ilahiyat Fakultesi Meram Yeniyol Cad. 136/A 42090 Meram, Konya, Turkey 
2011
2011
Data-centric storage solutions are energy-efficient algorithms in wireless sensor networks and will greatly reduce total network… 
2010
2010
This paper describes an architecture that can enhance a robot with the capability of performing automatic speech recognition even… 
2010
2010
Sheikh Said demonstrates the ‘Asr adhan at 3:36pm on August 15, 2010 at Sultan Abu el-Eala Mosque in Boulaq Abu el-Eala. He has… 
2008
2008
Channel estimation using preamble symbols is very important for demodulation and dynamic resource allocation in OFDM systems…