云南高校图书馆联盟文献共享服务平台- MAXIMUM

MAXIMUM: 作品数：885被引量：1474H指数：13; 导出分析报告; 相关领域：理学更多>>; 相关作者：孟庆武熊毅田铮郭小卫林伟更多>>; 相关机构：东南大学复旦大学北京师范大学清华大学更多>>; 相关期刊：更多>>; 相关基金：国家自然科学基金国家重点基础研究发展计划国家高技术研究发展计划中国博士后科学基金更多>>

Corrigendum to: Incremental algorithms for the maximum internal spanning tree problem: 《Science China(Information Sciences)》2022年第10期310-310,共1页Xianbin ZHU Wenjun LI Yongjie YANG Jianxin WANG; In the original paper[1],there are two errors on page 5.The rules in the algorithm are not sufficient since we omitted one rule during publication.The following rule should be added to the paper.; 关键词：SPANNING RULE MAXIMUM

Survey on rain removal from videos or a single image被引量：3: 《Science China(Information Sciences)》2022年第1期68-90,共23页Hong WANG Yichen WU Minghan LI Qian ZHAO Deyu MENG; supported by the National Key R&D Program of China(Grant No.2020YFA0713900);National Natural Science Foundation of China(Grant Nos.11690011,61721002,U1811461)。; Rain can cause performance degradation of outdoor computer vision tasks.Thus,the exploration of rain removal from videos or a single image has drawn considerable attention in the field of image processing.Recently,var...; 关键词：rain removal maximum a posterior estimation deep learning generalization performance comprehensive repository

Incremental algorithms for the maximum internal spanning tree problem被引量：2: 《Science China(Information Sciences)》2021年第5期73-80,共8页Xianbin ZHU Wenjun LI Yongjie YANG Jianxin WANG; supported by National Natural Science Foundation of China(Grant Nos.61672536,61502054,61702557,61420106009,61872048,61872450,61828205);Hunan Provincial Science and Technology Program(Grant No.2018WK4001);Natural Science Foundation of Hunan Province(Grant No.2017JJ3333);Scientific Research Fund of Hunan Provincial Education Department(Grant No.17C0047);China Postdoctoral Science Foundation(Grant No.2017M612584);Postdoctoral Science Foundation of Central South University。; The maximum internal spanning tree(MIST)problem is utilized to determine a spanning tree in a graph G,with the maximum number of possible internal vertices.The incremental maximum internal spanning tree(IMIST)problem ...; 关键词：maximum internal spanning tree incremental problem approximation algorithm competitive ratio

Color and direction-invariant nonlocal self-similarity prior and its application to color image denoising被引量：1: 《Science China(Information Sciences)》2020年第12期83-99,共17页Qi XIE Qian ZHAO Zongben XU Deyu MENG; Nonlocal self-similarity(NSS)is one of the most commonly used priors in computer vision and image processing.It aims to make use of the fact that a natural image often possesses many repetitive local patterns,and thus...; 关键词：color image denoising nonlocal self-similarity Gaussian mixture model maximum a posterior(MAP)model EM algorithm

Equivalent point estimation for small target groups tracking based on maximum group likelihood estimation被引量：2: 《Science China(Information Sciences)》2020年第8期256-258,共3页Chao ZHOU Rui WANG Cheng HU; National Natural Science Foundation of China(Grant No.31727901)。; Dear editor,Small target groups(STG),such as insect/bird[1]flocks and drone groups[2],have become new threats to civil aviation and urban security[3].With the advantages of long range and alltime/all-weather operation...; 关键词：EDITOR estimation LIKELIHOOD

On some aspects of minimum redundancy maximum relevance feature selection被引量：5: 《Science China(Information Sciences)》2020年第1期85-99,共15页Peter BUGATA Peter DROTAR; supported by Slovak Research and Development Agency (Grant No. APVV-16-0211); The feature selection is an important challenge in many areas of machine learning because it plays a crucial role in the interpretations of machine-driven decisions. There are various approaches to the feature selecti...; 关键词：big data information theory feature selection dimensionality reduction minimum redundancy maximum relevance m RMR

Constrained maximum weighted bipartite matching:a novel approach to radio broadcast scheduling被引量：1: 《Science China(Information Sciences)》2019年第7期156-169,共14页Shaojiang WANG Tianyong WU Yuan YAO Dongbo BU Shaowei CAI; supported by National Natural Science Foundation of China (Grant No. 61772503);National Basic Research Program of China (Grant No. 2014CB340302); Given a set of radio broadcast programs, the radio broadcast scheduling problem is to allocate a set of devices to transmit the programs to achieve the optimal sound quality. In this article, we propose a complete alg...; 关键词：RADIO broadcast scheduling BRANCH-AND-BOUND ALGORITHM CONSTRAINED MAXIMUM WEIGHTED bipartite matching Kuhn-Munkres ALGORITHM strategy combinations

Construction of rotation symmetric bent functions with maximum algebraic degree被引量：1: 《Science China(Information Sciences)》2018年第3期210-212,共3页Wenying ZHANG Guoyong HAN; supported by National Natural Science Foundation of China(Grant Nos.61272434,61672330,61602887); Boolean functions that are invariant under tile action of cyclic rotation on the inputs are called rotation symmetric functions [1]. Aside from their simple algebraic descriptions, rotation symmetric functions have im...; 关键词：GF ANF Construction of rotation symmetric bent functions with maximum algebraic degree

A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees: 《Science China(Information Sciences)》2016年第1期63-76,共14页Feng SHI Jianxin WANG Yufei YANG Qilong FENG Weilong LI Jianer CHEN; supported by National Natural Science Foundation of China(Grant Nos.61232001;61472449;61370172;61420106009);Research Fund for the Doctoral Program of Higher Education of China(Grant No.20130162130001); The Maximum Agreement Forest （MAF） problem on two given phylogenetic trees is an important NP-hard problem in the field of computational biology. In this paper, we study the parameterized version of the MAF problem...; 关键词：computational biology multifurcating phylogenetic tree maximum agreement forest TBR dis-tance fixed-parameter algorithm

Correlations between characteristics of maximum influence and degree distributions in software networks被引量：5: 《Science China(Information Sciences)》2014年第7期21-32,共12页GU Qing XIONG ShiJie CHEN DaoXu; supported by National Basic Research Program of China (Grant No.2009CB320705);National Natural Science Foundation of China (Grant Nos.61373012,91218302,60873027,61021062,61076094);National High-Tech Research & Development Program of China (Grant No.2006AA01Z177); Software systems can be represented as complex networks and their artificial nature can be investigated with approaches developed in network analysis.Influence maximization has been successfully applied on software ne...; 关键词：software network scale free influence maximization power law complex network

MAXIMUM