We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
The Knowledge Agent Mediation Language (KNAML) is designed for use in multi-agent reasoning systems. Like conceptual graphs, KNAML represents knowledge using concepts, relations, a...