نتایج جستجو برای: greedy algorithm
تعداد نتایج: 755539 فیلتر نتایج به سال:
In 1999, S. V. Konyagin and N. Temlyakov introduced the so-called Thresholding Greedy Algorithm. Since then, there have been many interesting useful characterizations of greedy-type bases in Banach spaces. this article, we study extend several greedy almost literature. Along way, give various examples to complement our main results. Furthermore, propose a new version Weak Algorithm (WTGA) show ...
Abstract One of the main goal in the mixture distributions is to determine the number of components. There are different methods for determination the number of components, for example, Greedy-EM algorithm which is based on adding a new component to the model until satisfied the best number of components. The second method is based on maximum entropy and finally the third method is based on non...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید