搜索结果: 1-3 共查到“信息与通信工程 N-gram”相关记录3条 . 查询时间(0.062 秒)
EFFECTIVENESS OF N-GRAM FAST MATCH FOR QUERY-BY-HUMMING SYSTEMS
N-gram Fast match Query-by-Humming
2013/6/28
To achieve a good balance between matching accuracy and computation efficiency is a key challenge for Query-by-Humming(QBH) system. In this paper, we propose an approach of n-gram based fast match. Ou...
有理函数逼近法方程组病态条件数为构建电源分配网络时域宏模型带来了数值问题。该文提出利用修正Gram-Schmidt正交化处理对超定方程组系数矩阵进行正交三角分解，结合Bernoulli多项式求根方法及稳定、无源性准则可以精确构建无源时域宏模型。计算实例精确构建了自DC至1GHz频带内的宽带无源时域宏模型，从而验证了该方法的有效性。