中文版 | English

在结果中检索

CSpace

浏览/检索结果: 共6条，第1-6条 帮助

已选(0)清除 条数/页：   排序方式：
Weights of exact threshold functions 期刊论文
IZVESTIYA MATHEMATICS, 2021, 卷号: 85, 期号: 6, 页码: 1039-1059
作者:  Babai, L.;  Hansen, K. A.;  Podolskii, V. V.;  Sun, Xiaoming
收藏  |  浏览/下载：20/0  |  提交时间：2022/12/07
computational complexity  Boolean functions  threshold functions  polynomial threshold functions  anti-Hadamard matrices  
On the modulo degree complexity of Boolean functions 期刊论文
THEORETICAL COMPUTER SCIENCE, 2020, 卷号: 818, 页码: 32-40
作者:  Li, Qian;  Sun, Xiaoming
收藏  |  浏览/下载：36/0  |  提交时间：2020/12/10
Boolean function  Degree complexity  Polynomial  Decision tree complexity  Hypergraph property  
Stochastic collocation method for interconnect delay estimation in the presence of process variations 期刊论文
ACTA PHYSICA SINICA, 2009, 卷号: 58, 期号: 6, 页码: 3603-3610
作者:  Li Xin;  Wang, Janet M.;  Tang Wei-Qing
收藏  |  浏览/下载：45/0  |  提交时间：2019/12/16
process variations  stochastic interconnect model  stochastic collocation method  polynomial chaos expression  
Supervised feature extraction algorithm based on improved polynomial entropy 期刊论文
JOURNAL OF INFORMATION SCIENCE, 2006, 卷号: 32, 期号: 4, 页码: 309-315
作者:  Ding, Shifei;  Shi, Zhongzhi
收藏  |  浏览/下载：41/0  |  提交时间：2019/12/16
information entropy theory  cross entropy (CE)  symmetrical cross entropy (SCE)  polynomial entropy (PE)  improved polynomial entropy (IPE)  supervised feature extraction  
On the k-closest substring and k-consensus pattern problems 期刊论文
COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2004, 卷号: 3109, 页码: 130-144
作者:  Jiao, YS;  Xu, JY;  Li, M
收藏  |  浏览/下载：76/0  |  提交时间：2019/12/16
k-center problems  closest string and substrings  consensus pattern  polynomial time approximation scheme  
Polynomial algorithm of limited propositional deduction 期刊论文
SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 1999, 卷号: 42, 期号: 4, 页码: 418-424
作者:  Shi, ZZ;  Liao, LJ
收藏  |  浏览/下载：72/0  |  提交时间：2019/12/16
limited propositional deduction  polynomial algorithm  problem of propositional satisfiability  constraint satisfaction problem