全部文献期刊会议图书|学者科研项目
中外文文献  中文文献  外文文献
作者:He Jiang , XianChao Zhang , GuoLiang Chen
来源:[J].Chinese Science Bulletin(IF 1.319), 2007, Vol.52 (20), pp.2871-2875Springer
摘要:... Due to the difficulty in the research on computational complexity of the backbone, many researchers analyzed the backbone by statistic ways. Aiming to increase the backbone size which is usually very small by the existing methods, the unique optimal solution instance constru...
作者:Zhenzhi Wu , Chen Gong , Dake Liu
来源:[J].Journal of Signal Processing Systems(IF 0.551), 2017, Vol.89 (2), pp.209-224Springer
摘要:The computational complexity evaluation is necessary for software defined Forward Error Correction (FEC) decoders. However, currently there are a limited number of literatures concerning on the FEC complexity evaluation using analytical methods. In this paper, three high efficien...
作者:Konrad Stephan , Nils Boysen
来源:[J].Journal of Scheduling(IF 0.941), 2017, Vol.20 (5), pp.507-526Springer
摘要:... This paper contributes to this stream of research by investigating the computational complexity of crane scheduling in these yards. Scheduling the transfer of a given set of containers by a single crane equals the (asymmetric) traveling salesman problem in its path-version. I...
作者:Won-Hee Kim , Jong-Seok Lee
来源:[J].Multimedia Tools and Applications(IF 1.014), 2017, Vol.76 (5), pp.7235-7249Springer
摘要:This paper proposes a single image super resolution algorithm with the aim of satisfying three desirable characteristics, namely, high quality of the produced images, adaptability to image contents and unknown blurring conditions used to generate given input images, and low computational complexity...
作者:Daniel Bork , Ricson Cheng , Jincheng Wang ...
来源:[J].Algorithms for Molecular Biology(IF 1.606), 2017, Vol.12 (1)Springer
摘要:Phylogenetic tree reconciliation is a widely-used method for inferring the evolutionary histories of genes and species. In the duplication-loss-coalescence (DLC) model, we seek a reconciliation that explains the incongruence between a gene and species tree using gene duplication,...
作者:Miodrag Bolić , Petar M. Djurić , Sangjin Hong
来源:[J].EURASIP Journal on Advances in Signal Processing(IF 0.807), 2004, Vol.2004 (15), pp.1-11Springer
摘要:... The new algorithms reduce the complexity of both hardware and DSP realization through addressing common issues such as decreasing the number of operations and memory access. Moreover, the algorithms allow for use of higher sampling frequencies by overlapping in time the resam...
作者:Gregory S. Taylor , Yupo Chan , Ghulam Rasool
来源:[J].Annals of Operations Research(IF 1.029), 2017, Vol.251 (1-2), pp.397-427Springer
摘要:... When the items to be packed are arranged in non-increasing order by height or by volume, this lower bound is shown to be of computational complexity \({ O(p)}\) , both theoretically and computationally. Since ours is an exact solution rather than a heuristic solution, the bou...
作者:Saheed A. Adegbite , Scott McMeekin , Brian G. Stewart
来源:[J].Wireless Personal Communications(IF 0.428), 2017, Vol.97 (1), pp.661-674Springer
摘要:... However, the need for SI estimation poses some practical issues in the form of high computational complexity and implementation challenges. Through simulations, this paper investigates the performance of an alternative data decoding approach called Embedded Coded Modulation (...
作者:K. S. Kobylkin
来源:[J].Proceedings of the Steklov Institute of Mathematics(IF 0.277), 2017, Vol.299 (1), pp.106-112Springer
摘要:We study the computational complexity of the vertex cover problem in the class of planar graphs (planar triangulations) admitting a plane representation whose faces are triangles. It is shown that the problem is strongly NP-hard in the class of 4-connected planar triangulation...
作者:Yun Shi , Peiliang Xu , Junhuan Peng
来源:[J].Studia Geophysica et Geodaetica(IF 0.975), 2017, Vol.61 (4), pp.601-615Springer
摘要:... We analyze the computational complexity of the celebrated Tienstra’s method and compare it with that of the method of Lagrange multipliers. We show that Tienstra’s method is not only statistically elegant but also interestingly of significant computational advantage over...

我们正在为您处理中,这可能需要一些时间,请稍等。

资源合作:cnki.scholar@cnki.net, +86-10-82896619   意见反馈:scholar@cnki.net

×