نتایج جستجو برای: graph algorithm
تعداد نتایج: 897475 فیلتر نتایج به سال:
In combinatorial design theory, clustering elements into a set of three is the heart classifying data, which has recently received considerable attention in fields network algorithms, cryptography, and analysis statistics, Information theory. This article provides insight formulating algorithm for new type triple system, called Butterfly system. Basically, this development, starter cyclic near-...
Graph signal processing is a ubiquitous task in many applications such as sensor, social, transportation and brain networks, point cloud processing, graph neural networks. Often, signals are corrupted the sensing process, thus requiring restoration. In this paper, we propose two restoration methods based on deep algorithm unrolling (DAU). First, present denoiser by iterations of alternating dir...
Abstract The commodity data in the shopping system contains a wealth of feature information, and different commodities are related by these features. Traditional collaborative filtering algorithms represent structured way, but they have issues such as low similarity calculation accuracy, poor recommendation effect, unfriendly results. algorithm based on knowledge graph put forward this paper in...
in recent years wireless sensor networks have attracted researchers' attention due to vast applications. one of the most prominent issues regarding these networks is coverage which is considered as a quality of service parameter. in this study, we try to address energy shortage in wsns through finding a set of optimal coverage nodes in a specific environment. this is performed utilizing effecti...
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
multicast routing is one of the most important services in multi radio multi channel (mrmc) wireless mesh networks (wmn). multicast routing performance in wmns could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. in this paper we want to address the multicast routing problem for a given channel assignment in wmns. the channels...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید