A new morphological gradient operator for colour images is introduced that can be viewed as a direct extension of the well known morphological gradient. In this approach, each pix...
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
We describe a new method of multi-touch sensing which can be unobtrusively added to existing displays. By coupling individually controlled optoelectronics to the edge of a planar ...
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Many behavioral researchers have been or are currently engaged in survey research, analyzing results using statistical methods. Respondents are often asked to fill out questionnai...