Sciweavers

244 search results - page 15 / 49
» Compressive PCA on Graphs
Sort
View
GLOBECOM
2009
IEEE
14 years 5 months ago
Multi-Functional Compression with Side Information
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
Soheil Feizi-Khankandi, Muriel Médard
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
14 years 3 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
IDA
2007
Springer
13 years 11 months ago
Inference of node replacement graph grammars
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
ICVS
2003
Springer
14 years 4 months ago
A Spectral Approach to Learning Structural Variations in Graphs
This paper shows how to construct a linear deformable model for graph structure by performing principal components analysis (PCA) on the vectorised adjacency matrix. We commence b...
Bin Luo, Richard C. Wilson, Edwin R. Hancock