نتایج جستجو برای: path co efficient
تعداد نتایج: 879162 فیلتر نتایج به سال:
Path openings and closings are algebraic morphological operators using families of thin and oriented structuring elements that are not necessarily perfectly straight. These operators are naturally translation invariant and can be used in filtering applications instead of operators based on the more standard families of straight line structuring elements. They give similar results to area or att...
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
Screening of twenty-four candidate plus trees from naturally available Pongamia pinnata genetic resources was carried out to elucidate the genetic variation and relationship of pod and seed traits on germination capacity to select the best planting material for higher productivity. The experiment conducted at Forest Research Centre, Institute of Forest Productivity Mandar, Ranchi during 2005-20...
Graph is a ubiquitous structure representing entities and their relationships applied in many areas such as social networks, web graphs, biological networks. One of the fundamental tasks graph analytics to investigate relations between two vertices (e.g., users, items, entities) how vertex A influences another B, or what extent B are similar each other, based on topology structure. For this pur...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید