中文版 | English

在结果中检索

CSpace

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

已选(0)清除 条数/页：   排序方式：
On the complexity of sequentially lifting cover inequalities for the knapsack polytope 期刊论文
SCIENCE CHINA-MATHEMATICS, 2020, 页码: 10
作者:  Chen, Wei-Kun;  Dai, Yu-Hong
收藏  |  浏览/下载：180/0  |  提交时间：2020/05/24
integer programming  sequentially lifted cover inequality  complexity  lifting problem  
Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2020, 卷号: 76, 期号: 4, 页码: 913-932
作者:  Jarre, Florian;  Lieder, Felix;  Liu, Ya-Feng;  Lu, Cheng
收藏  |  浏览/下载：212/0  |  提交时间：2020/05/24
Max-cut problem  Complex variables  Semidefinite relaxation  Unit modulus lifting  
Two-step single parameter regularization Fisher discriminant method for face recognition 期刊论文
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2006, 卷号: 20, 期号: 2, 页码: 189-207
作者:  Chen, WS;  Yuen, PC;  Huang, J;  Fang, B
收藏  |  浏览/下载：170/0  |  提交时间：2018/07/30
face recognition  Fisher discriminant analysis  small sample size problem  rank lifting scheme