نتایج جستجو برای: singed distance
تعداد نتایج: 238359 فیلتر نتایج به سال:
in this paper, we determine the degree distance of the complement of arbitrary mycielskian graphs. it is well known that almost all graphs have diameter two. we determine this graphical invariant for the mycielskian of graphs with diameter two.
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph Γ is distance-regular and homogeneous. More precisely, Γ is edge-distance-regular if and only if it is bipartite distance-reg...
Abstract This paper proposes a new method to improve performance of AdaBoost by using a distance weight function to increase the accuracy of its machine learning processes. The proposed distance weight algorithm improves classification in areas where the original binary classifier is weak. This paper derives the new algorithm’s optimal solution, and it demonstrates how classifier accuracy can b...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید