Sciweavers

126 search results - page 1 / 26
» Lossless Representation of Graphs using Distributions
Sort
View
CORR
2007
Springer
69views Education» more  CORR 2007»
13 years 4 months ago
Lossless Representation of Graphs using Distributions
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...
Mireille Boutin, Gregor Kemper
DCC
2007
IEEE
14 years 4 months ago
Structure induction by lossless graph compression
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...
Leonid Peshkin
ICASSP
2011
IEEE
12 years 8 months ago
Optimal structure of memory models for lossless compression of binary image contours
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...
Ioan Tabus, Septimia Sarbu
TIT
2010
138views Education» more  TIT 2010»
12 years 11 months ago
Functional compression through graph coloring
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...
Vishal Doshi, Devavrat Shah, Muriel Médard,...
ICCS
2004
Springer
13 years 10 months ago
KNAML: A Knowledge Representation Language for Distributed Reasoning
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...
Gordon Streeter, Andrew Potter