CSpace

Browse/Search Results:  1-10 of 13 Help

Selected(0)Clear Items/Page:    Sort:
Parameterized Dynamic Cluster Editing 期刊论文
ALGORITHMICA, 2020, 页码: 44
Authors:  Luo, Junjie;  Molter, Hendrik;  Nichterlein, Andre;  Niedermeier, Rolf
Favorite  |  View/Download:17/0  |  Submit date:2020/09/23
Graph-based data clustering  Incremental clustering  Compromise clustering  Correlation clustering  Local search  Goal-oriented clustering  NP-hard problems  Fixed-parameter tractability  Parameterized complexity  Kernelization  Multi-choice knapsack  
Breaking the hardness assumption and IND-CPA security of HQC submitted to NIST PQC project 期刊论文
IET INFORMATION SECURITY, 2020, 卷号: 14, 期号: 3, 页码: 313-320
Authors:  Liu, Zhen;  Pan, Yanbin;  Xie, Tianyuan
Favorite  |  View/Download:20/0  |  Submit date:2020/10/12
decoding  public key cryptography  quantum cryptography  computational complexity  optimisation  cyclic codes  IND-CPA security  NIST PQC project  hamming quasicyclic cryptosystem  code-based key encapsulation mechanism  NIST standardisation process  public-key encryption scheme  IND-CCA2 secure KEM  revised scheme HQC- beta  HQC cryptosystem  s-DQCSD problem  s-decision quasi-cyclic syndrome decoding  plaintext attack  
Clustering phase of a general constraint satisfaction problem model d-k-CSP 期刊论文
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 卷号: 537, 页码: 15
Authors:  Xu, Wei;  Gong, Fuzhou;  Zhou, Guangyan
Favorite  |  View/Download:44/0  |  Submit date:2020/05/24
Constraint satisfaction problem  Solution space structure  Clustering phase transition  Problem hardness  Belief propagation  
Network Slicing for Service-Oriented Networks Under Resource Constraints 期刊论文
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2017, 卷号: 35, 期号: 11, 页码: 2512-2521
Authors:  Zhang, Nan;  Liu, Ya-Feng;  Farmanbar, Hamid;  Chang, Tsung-Hui;  Hong, Mingyi;  Luo, Zhi-Quan
Favorite  |  View/Download:16/0  |  Submit date:2018/07/30
Software defined network  network function virtualization  traffic engineering  
The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete 期刊论文
AUTOMATICA, 2017, 卷号: 81, 页码: 217-220
Authors:  Zhang, Kuize
Favorite  |  View/Download:37/0  |  Submit date:2018/07/30
Discrete event system  Finite automaton  Weak (periodic) detectability  PSPACE-hardness  
Dynamic Spectrum Management: A Complete Complexity Characterization 期刊论文
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 卷号: 63, 期号: 1, 页码: 392-403
Authors:  Liu, Ya-Feng
Favorite  |  View/Download:9/0  |  Submit date:2018/07/30
Complexity theory  multi-carrier communication system  spectrum management  strong NP-hardness  
Shortest path and maximum flow problems in networks with additive losses and gains 期刊论文
THEORETICAL COMPUTER SCIENCE, 2011, 卷号: 412, 期号: 4-5, 页码: 391-401
Authors:  Brandenburg, Franz J.;  Cai, Mao-cheng
Favorite  |  View/Download:12/0  |  Submit date:2018/07/30
Extended networks  Lossy and gainy arcs  Max-flow problems  Shortest path problems  NP-hard problems  Unit-loss networks  
SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN 期刊论文
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2010, 卷号: 27, 期号: 4, 页码: 493-501
Authors:  Zhang, Shu-Xia;  Cao, Zhi-Gang;  Zhang, Yu-Zhong
Favorite  |  View/Download:12/0  |  Submit date:2018/07/30
Scheduling  discretely compressible release dates  approximation algorithm  makespan  
Scheduling with rejection and non-identical job arrivals 期刊论文
JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2007, 卷号: 20, 期号: 4, 页码: 529-535
Authors:  Cao, Zhigang;  Zhang, Yuzhong
Favorite  |  View/Download:9/0  |  Submit date:2018/07/30
non-identical job arrival  on-line  rejection  scheduling  
schedulingwithrejectionandnonidenticaljobarrivals 期刊论文
journalofsystemsscienceandcomplexity, 2007, 卷号: 020, 期号: 004, 页码: 529
Authors:  Zhigang Cao;  Yuzhong Zhang
Favorite  |  View/Download:4/0  |  Submit date:2020/01/10