In this paper, we propose a new hybrid Cross Hexagon Diamond Search algorithm (CHDS) using crossshaped search pattern as the initial step and asymmetric hexagon-shaped patterns and small diamond pattern as the subsequent steps for fast block motion estimation. In block motion estimation, search pattern with different shape or size and the center biased motion vector distribution characteristics...

We design an O(n) algorithm to find a minimum weighted coloring of a (P5, P 5)free graph. Furthermore, the same technique can be used to solve the same problem for several classes of graphs, defined by forbidden induced subgraphs, such as (diamond, co-diamond)-free graphs.

In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognition algorithm for the diamond-free graphs which keeps the combinatorial structure of the graph by means of the decomposition, as well as an easy possibility to determine the clique number for the diamond-free graphs.

Focused Ion Beam (FIB) has been demonstrated as a promising tool to the fabrication of microand nanoscale diamond cutting tools. In-depth understanding of the ion-solid interaction in diamond leading to residual damage under different processing parameters are in high demand for the fabrication of nanoscale diamond tools. Molecular dynamics (MD) simulation method has long been regarded as a pow...

In this paper, we study the problem of mining frequent diamond episodes efficiently from an input event sequence with sliding a window. Here, a diamond episode is of the form a → E → b, which means that every event of E follows an event a and is followed by an event b. Then, we design a polynomial-delay and polynomial-space algorithm PolyFreqDmd that finds all of the frequent diamond episodes w...

this paper deals with ridge estimation of fuzzy nonparametric regression models using triangular fuzzy numbers. this estimation method is obtained by implementing ridge regression learning algorithm in the la- grangian dual space. the distance measure for fuzzy numbers that suggested by diamond is used and the local linear smoothing technique with the cross- validation procedure for selecting t...

This paper presents a new algorithm for motion estimation in high definition videos and it also proposes a hardware architecture to perform it. The algorithm uses a random search in the candidate blocks as strategy to avoid local minima falls and to increase the motion estimation quality . This algorithm is called Galaxy Random Search (GRS). Software evaluation shows that the GRS algorithm can ...

This paper deals with ridge estimation of fuzzy nonparametric regression models using triangular fuzzy numbers. This estimation method is obtained by implementing ridge regression learning algorithm in the La- grangian dual space. The distance measure for fuzzy numbers that suggested by Diamond is used and the local linear smoothing technique with the cross- validation procedure for selecting t...

The diamond is the graph obtained by removing an edge from complete on 4 vertices. A (\(P_6\), diamond)-free if it contains no induced subgraph isomorphic to a six-vertex path or diamond. In this paper we show that chromatic number of G larger than maximum 6 and clique G. We do reducing problem imperfect graphs via Strong Perfect Graph Theorem, dividing into several cases, giving proper colouri...

While attempting to classify partial linear spaces produced during the execution of an extension of Stinson’s hill-climbing algorithm a new problem arises, that of generating all graphical degree sequences that are diamond-free (i.e. have no diamond as subgraph) and satisfy additional constraints. We formalize this new problem, propose a constraint programming solution and list all satisfying d...