CSpace

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

已选(0)清除 条数/页:   排序方式:
Towards understanding residual and dilated dense neural networks via convolutional sparse coding 期刊论文
NATIONAL SCIENCE REVIEW, 2021, 卷号: 8, 期号: 3, 页码: 13
作者:  Zhang, Zhiyang;  Zhang, Shihua
收藏  |  浏览/下载:181/0  |  提交时间:2021/10/26
convolutional neural network  convolutional sparse coding  residual neural network  mixed-scale dense neural network  dilated convolution  dense connection  
Characterizations of semi-prequasi-invexity 期刊论文
JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2014, 卷号: 27, 期号: 5, 页码: 1008-1026
作者:  Zhao Yingxue;  Meng Xiaoge;  Qiao Han;  Wang Shouyang;  Coladas Uria Luis
收藏  |  浏览/下载:150/0  |  提交时间:2021/01/14
PREINVEX FUNCTIONS  GENERALIZED CONVEXITY  SETS  Convex programming  dense  semi-prequasi-invex function  strictly semi-prequasi-invex function  strongly semi-prequasi-invex function  
Approximation of dense-n/2-subgraph and table compression problems 期刊论文
SCIENCE IN CHINA SERIES A-MATHEMATICS, 2005, 卷号: 48, 期号: 9, 页码: 1223-1233
作者:  Xu, DC;  Han, JY;  Du, DL
收藏  |  浏览/下载:114/0  |  提交时间:2018/07/30
dense-n/2-subgraph problem (DSP)  table compression problem (TCP)  SDP  approximation ratio  
On well-posed mutually nearest and mutually furthest point problems in Banach spaces 期刊论文
ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2004, 卷号: 20, 期号: 1, 页码: 147-156
作者:  Li, C;  Ni, RX
收藏  |  浏览/下载:110/0  |  提交时间:2018/07/30
mutually nearest point  mutually furthest point  well posedness  dense G(delta)-subset  
Improved approximation algorithms for MAX n/2-DIRECTED-BISECTION and MAX n/2-DENSE-SUBGRAPH 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2003, 卷号: 27, 期号: 4, 页码: 399-410
作者:  Xu, DC;  Han, JY;  Huang, ZH;  Zhang, LP
收藏  |  浏览/下载:136/0  |  提交时间:2018/07/30
MAX n/2-DIRECTED-BISECTION  MAX n/2-DENSE-SUBGRAPH  polynomial-time approximation algorithm  semidefinite programming  
P-points in Q(max) models 期刊论文
ANNALS OF PURE AND APPLIED LOGIC, 2003, 卷号: 119, 期号: 1-3, 页码: 121-190
作者:  Feng, Q;  Woodin, WH
收藏  |  浏览/下载:79/0  |  提交时间:2018/07/30
forcing  consistency  dense ideal