|A new method of model registration is proposed using graphical templates. A decomposable graph of landmarks is chosen in the template image. All possible candidates for these landmarks are found in the data image using robust relational local operators. A dynamic programming algorithm on the template graph nds the optimal match to a subset of the candidate points in polynomial time. This combi...

A graphical model is a family of probability distributions incorporating the conditional independence assumptions represented by a graph. They are constructed by specifying local dependencies of each node of the graph in terms of its immediate neighbours. It is then possible to work locally, obtaining better results in terms of statistical inference and computational eeciency. Our motivation he...

A completely decomposable group is an abelian group of the form ⊕ i Hi, where Hi ≤ (Q,+). We show that every computable completely decomposable group is ∆5-categorical. We construct a computable completely decomposable group which is not ∆4-categorical, and give an example of a computable completely decomposable group G which is ∆4-categorical but not ∆3-categorical. We also prove that the inde...

We show that the $$\mathrm {v}$$ -number of an arbitrary monomial ideal is bounded below by its polarization and also find a criteria for equality. By showing additivity associated primes ideals, we obtain v-numbers ideals. prove {v}(I(G))$$ edge I(G), induced matching number {im}(G)$$ regularity {reg}(R/I(G))$$ graph G, satisfy {v}(I(G))\le \mathrm {im}(G)\le , where G either bipartite graph, ...

Decomposable mappings from the space of symmetric k-fold tensors over E, ⊗ s,k E, to the space of k-fold tensors over F , ⊗ s,k F , are those linear operators which map nonzero decomposable elements to nonzero decomposable elements. We prove that any decomposable mapping is induced by an injective linear operator between the spaces on which the tensors are defined. Moreover, if the decomposable...

We bound the error for normal approximation of number triangles in Erd?s–Rényi random graph with respect to Kolmogorov metric. Our bounds match best available Wasserstein obtained by Barbour et al. [(1989). A central limit theorem decomposable variables applications graphs. Journal Combinatorial Theory, Series B 47: 125–145], resolving a long-standing open problem. The proofs are based on new v...