In this paper we propose a new method to deal with the problem of automatic human skin segmentation in RGB color space model. The problem is modeled as a minimum cost graph cut problem on a graph whose vertices represent the image color characteristics. Skin and non-skin elements are assigned by evaluating label costs of vertices associated to the weight edges of the graph. A novel approach bas...

In order to obtain perfect state transfer between two sites in a network of interacting qubits, their corresponding vertices in the underlying graph must satisfy a property called strong cospectrality. Here we determine the structure of graphs containing pairs of vertices which are strongly cospectral and satisfy a certain extremal property related to the spectrum of the graph. If the graph sat...

We study group-summarization of probabilistic graphs that naturally arise in social networks, semistructured data, and other applications. Our proposed framework groups the nodes and the edges of the graph based on a user selected set of node attributes. We present methods to compute useful graph aggregates without the need to create all of the possible graph-instances of the original probabili...

Animated graph gives some good impressions in presenting information. However, not many people are able to produce it because the process of generating an animated graph requires some technical skills. This work presents Content Management System with Animated Graph (CMS-AG). It is a webbased system enabling users to produce an effective and interactive graphical report in a short time period. ...

Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph search is a key problem, which is defined as given a query Q, retrieving all graphs containing Q as a sub-graph in the graph database. Most existing sub-graph search methods try to filter out false positives (graphs t...

Visualizing a graph of any complexity can be di cult, particularly if arbitrary details decorating both the vertex set and arc set are required to be rendered. A graph algorithm visualizing tool GraViz has been developed using Java and Java-Swing rendering technology. The design ideas and data structures used in GraViz are presented and some directions for future enhancement are discussed. A de...

Kumar N . Sivarajan and Robert J . McEliece, California Institute of Technology,’ and John W. Ketchum, GTE Laboratories Incorporated. In this paper, we describe some heuristic channel assignment algorithms for cellular systems, that we have recently developed. These algorithms have yielded optimal, or near-optimal assignments, in many cases. The channel assignment problem can be viewed as a gen...

Users of traditional microblogging platforms such as Twitter face drawbacks in terms of (1) Privacy of status updates as a followee – reaching undesired people (2) Information overload as a follower – receiving uninteresting microposts from followees. In this paper we demonstrate distributed and user-controlled dissemination of microposts using SMOB (semantic microblogging framework) and Semant...

We introduce a new probabilistic framework for collectively modeling people’s social behavior from local sensor observations. Our approach extends curved exponential random graph models to (1) include features that account for multivalued edges, and (2) model the change in edge values over time. We present empirical results on a real world dataset of face-to-face conversations collected from 24...

Target detection from a set of observations, where the target is from a set of given library spectra is a difficult task. A major reason for false positives or misclassifications in detection is canonical correlations with linear combinations of spectra, a serious problem especially for subspace-based detectors using canonical correlations or least squares. We propose a partitioning scheme for ...