نتایج جستجو برای: computational complexity
تعداد نتایج: 530975 فیلتر نتایج به سال:
Abstract Residual closeness is recently proposed as a vulnerability measure to characterize the stability of complex networks. essential in analysis networks, but costly compute. Currently, fastest known algorithms run polynomial time. Motivated by fast-growing need compute measures on new for computing node and edge residual are introduced this paper. Those reduce running times Θ(n 3 ) Θ (n 4 ...
The notion of graph covers is a discretization covering spaces introduced and deeply studied in topology. In discrete mathematics theoretical computer science, they have attained lot attention from both the structural complexity perspectives. Nonetheless, disconnected graphs were usually omitted considerations with explanation that it sufficient to understand coverings connected components targ...
three dimensional- high efficiency video coding (3D-HEVC) is the expanded version of the latest video compression standard, namely high efficiency video coding (HEVC), which is used to compress 3D videos. 3D videos include texture video and depth map. Since the statistical characteristics of depth maps are different from those of texture videos, new tools have been added to the HEVC standard fo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید