Data communications between producer instructions and consumer instructions through memory incur extra delays that degrade processor performance. In this paper, we introduce a new storage media with a novel addressing mechanism to avoid address calculations. Instead of a memory address, each load and store is assigned a signature for accessing the new storage. A signature consists of the color ...

A proper edge-coloring of a graph G is a mapping α : E(G)→ N such that α(e) 6= α(e′) for every pair of adjacent edges e, e′ ∈ E(G). A proper edge-coloring of a graph G is an interval coloring if the colors of edges incident to each vertex of G form an interval of integers. A graph G is interval colorable if it has an interval coloring. Since not all graphs admit an interval coloring, a measure ...

In order to obtain more complete and continuous edge information of the image, the image enhancement methods and Hessian matrix are used in the process of edge detection. Based on the gradient information of color images, the pseudo-color edges can be got by using the multichannel edge detection. Then, enhance the edge information and remove the correlation to obtain complete edge information. ...

A b-coloring is a proper coloring of the vertices of a graph such that each color class has a vertex that is adjacent to a vertex of every other color. The b-chromatic number b(G) of a graph G is the largest k such that G admits a b-coloring with k colors. A graph G is b-chromatic edge critical if for any edge e of G, the b-chromatic number of G − e is less than the b-chromatic number of G. We ...

An edge-coloring of a graph G with consecutive integers c1, . . . , ct is called an interval t-coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. The set of all interval colorable graphs is denoted by N. In 2004, Giaro and...

We present in this paper a new method for contrast enhancement based on the curvelet transform. The curvelet transform represents edges better than wavelets, and is therefore well-suited for multiscale edge enhancement. We compare this approach with enhancement based on the wavelet transform, and the Multiscale Retinex. In a range of examples, we use edge detection and segmentation, among other...

The objective of the present project is to uses a new techniques for steganography in a HSI color cover images, which hides secret message in the edges of the carrier images using 2-bit LSB substitution for embedding. To get true edges, canny edge detection technique has been used. Amount of data to be embedded plays an important role on the selection of edges. The main advantage of using HIS c...

An edge-coloring of a graph G with colors 1, 2, . . . , t is an interval t-coloring if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. For an interval colorable graph G, W (G) denotes the greatest value of t for which G has an int...

A face of an edge colored plane graph is called rainbow if all its edges receive distinct colors. The maximum number of colors used in an edge coloring of a connected plane graph G with no rainbow face is called the edge-rainbowness of G. In this paper we prove that the edge-rainbowness of G equals to the maximum number of edges of a connected bridge face factor H of G, where a bridge face fact...

In this paper, we present a novel approach on road sign segmentation under bad lighting condition employing a modified fuzzy c-means clustering. Most of the cases accidents occur in bad weather or when the road signs cannot be recognized. The proposed system implements a system that segments the road sign using fuzzy c-means clustering. At first, the image is detected in RGB colour space and th...