0

‎a $(p‎,‎q)$ graph $g$ is said to have a $k$-odd mean‎ ‎labeling $(k ge 1)$ if there exists an injection $f‎ : ‎v‎ ‎to {0‎, ‎1‎, ‎2‎, ‎ldots‎, ‎2k‎ + ‎2q‎ - ‎3}$ such that the‎ ‎induced map $f^*$ defined on $e$ by $f^*(uv) =‎ ‎leftlceil frac{f(u)+f(v)}{2}rightrceil$ is a‎ ‎bijection from $e$ to ${2k - ‎‎‎1‎, ‎2k‎ + ‎1‎, ‎2k‎ + ‎3‎, ‎ldots‎, ‎2‎ ‎k‎ + ‎2q‎ - ‎3}$‎. ‎a graph that admits $k$...

We consider the evolution of sets by nonlocal mean curvature and we discuss preservation along flow two geometric properties, which are convexity outward minimality. The main tools in our analysis level set formulation minimizing movement scheme for flow. When initial is minimizing, also show convergence (time integrated) perimeters discrete evolutions to perimeter limit

A new classiier using neighborhood information in the framework of the Dempster-Shafer theory of evidence has recently been introduced. This approach consists in considering each neighbor of a pattern to be classiied as an item of evidence supporting certain hypotheses concerning the class membership of that pattern. In this paper, an adap-tive version of this method is proposed, in which the p...

Data is the most valuable asset in any firm. As time passes, data expands at a breakneck speed. A major research issue extraction of meaningful information from complex and huge source. Clustering one methods. The basic K-Mean Parallel partition clustering algorithms work by picking random starting centroids. parallel methods are investigated this using two different datasets with sizes 10000 5...