نتایج جستجو برای: label energy of graph
تعداد نتایج: 21252948 فیلتر نتایج به سال:
some new water-soluble schiff base complexes of na2[m(5-so3-1,2-salophen)].nh2o; (5-so3-1,2-salophen = n,n’-bis(5-sulphosalicyliden)-1,2-phenylendiamine); na2[m(5-so3-2,3-salpyr)(h2o)n].2h2o; (5-so3-2,3-salpyr = n,n’-bis(5-sulphosalicyliden)-2,3-diaminopyridine); and na2[m(5-so3-3,4-salbenz)(h2o)n].nh2o; (5-so3-3,4-salbenz = n,n’-bis(5-sulphosalicyliden)-3,4-diaminobenzophenon); where m = cu, n...
We study the problem of predicting the labelling of a graph. The graph is given and a trial sequence of (vertex,label) pairs is then incrementally revealed to the learner. On each trial a vertex is queried and the learner predicts a boolean label. The true label is then returned. The learner’s goal is to minimise mistaken predictions. We propose minimum p-seminorm interpolation to solve this pr...
• Example: " label smoothing " grid Unary potential 0 1 0 0 K 1 K 0 Pairwise Potential 0:-logP(y i = 0 ; data) 1:-logP(y i = 1 ; data) ∑ ∑ ∈ + = edges j i j i i i data y y data y data Energy , 2 1 Main idea: • Construct a graph such that every st-cut corresponds to a joint assignment to the variables y • The cost of the cut should be equal to the energy of the assignment, E(y; data) *. • The mi...
a graph g is said to have a totally magic cordial labeling with constant c if there exists a mapping f : v (g) ∪ e(g) → {0, 1} such that f(a) + f(b) + f(ab) ≡ c (mod 2) for all ab ∈ e(g) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. in this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
In this paper, we present a graph cut-based motion segmentation method that takes occlusion into account. We formulate the motion segmentation problem in terms of energy minimization with accounting for occlusion and minimize the energy function with the divisive graph cut algorithm where multiway minimum cuts for motion segmentation are efficiently computed through the swap move and split move...
the study of air infiltration into the buildings is important from several perspectives that may be noted to energy and design of hvac systems, indoor air quality and thermal comfort and design of smoke control systems. given the importance of this issue, an experimental and numerical study of air infiltration through conventional doors and windows has been explored in iran. to this end, at fir...
let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...
in this investigation the effect of external field on the electron density of nanostructures of cds, cdse, cdte, gaas and polymeric structure of three, four, five and six units of cds as a kind of nanosolar cells has been studied theoretically. as modeling this system in nanodimension, molecular structures has used. specific properties of molecular structures permit us to consider different sym...
We introduce the Laplacian sum-eccentricity matrix LS_e} of a graph G, and its Laplacian sum-eccentricity energy LS_eE=sum_{i=1}^n |eta_i|, where eta_i=zeta_i-frac{2m}{n} and where zeta_1,zeta_2,ldots,zeta_n are the eigenvalues of LS_e}. Upper bounds for LS_eE are obtained. A graph is said to be twinenergetic if sum_{i=1}^n |eta_i|=sum_{i=1}^n |zeta_i|. Conditions ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید