نتایج جستجو برای: data flow graph
تعداد نتایج: 2949094 فیلتر نتایج به سال:
We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets coming from e-commerce and internet applications. We are primarily interested in cardinal data based on scores or ratings though our methods also give specific insights on ordinal data. From raw ranking data, we construct ...
to evaluate the hydrogeochemical characteristics of karst water resources of oshtorankooh, chemistry details of springs has been considered as the most important evacuator of karst resources. this research has been performed to study hydrogeochemical nature of karst springs and their origin with an emphasis on the type of formation. accordingly, five samples of the water of permanent springs o...
In recent years, school management systems have become an important tool for effective e-leadership and data-based decision making. School systems emphasize an information flow and e-communication between teachers, students, and parents. This study examines e-leadership by secondary-school principals through the Mashov school system implemented in 500 Israeli schools in order to increase school...
While diierent optical ow techniques continue to appear, there has been a lack of quantitative evaluation of existing methods. For a common set of real and synthetic image sequences, we report the results of a number of regularly cited optical ow techniques, including instances of diierential, matching, energy-based and phase-based methods. Our comparisons are primarily empirical, and concentra...
This article uses a new data structure namely System Flow Graph (SFG) that offers a compact representation of information dissemination induced by an execution of an application to characterize malicious application behavior and lead some experiments on 4 malware families DroidKungFu1, DroidKungFu2, jSMSHider, BadNews. We show how SFG are relevant to exhibit malware behavior.
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
Dynamic data-structures are ubiquitous in programming, and they use extensively underlying directed multi-graph structures, such as labeled trees, DAGs, and objects. This paper adapts well-established static analysis methods, namely data ramification and language-based information flow security, to programs over such graph structures. Our programs support the creation, deletion, and updates of ...
ÐData driven architectures have significant potential in the design of high performance ASICs. By exploiting the inherent parallelism in the application, these architectures can maximize pipelining. The key consideration involved with the design of a data driven ASIC is ensuring that throughput is maximized while a relatively low area is maintained. Optimal throughput can be realized by ensurin...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید