Sciweavers

DAM
2006
66views more  DAM 2006»
13 years 5 months ago
On the structure of the adjacency matrix of the line digraph of a regular digraph
We show that the adjacency matrix M of the line digraph of a d-regular digraph D on n vertices can be written as M = AB, where the matrix A is the Kronecker product of the all-one...
Simone Severini
CORR
2006
Springer
68views Education» more  CORR 2006»
13 years 5 months ago
State Space Realizations and Monomial Equivalence for Convolutional Codes
: We will study convolutional codes with the help of state space realizations. It will be shown that two such minimal realizations belong to the same code if and only if they are e...
Heide Gluesing-Luerssen, Gert Schneider
CORR
2006
Springer
135views Education» more  CORR 2006»
13 years 5 months ago
On the MacWilliams Identity for Convolutional Codes
: The adjacency matrix associated with a convolutional code collects in a detailed manner information about the weight distribution of the code. A MacWilliams Identity Conjecture, ...
Heide Gluesing-Luerssen, Gert Schneider
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 5 months ago
A Simple Message-Passing Algorithm for Compressed Sensing
We consider the recovery of a nonnegative vector x from measurements y = Ax, where A {0, 1}m
Venkat Chandar, Devavrat Shah, Gregory W. Wornell
APVIS
2008
13 years 6 months ago
ZAME: Interactive Large-Scale Graph Visualization
We present the Zoomable Adjacency Matrix Explorer (ZAME), a visualization tool for exploring graphs at a scale of millions of nodes and edges. ZAME is based on an adjacency matrix...
Niklas Elmqvist, Thanh-Nghi Do, Howard Goodell, Na...
BMVC
2001
13 years 7 months ago
Graph Matching using Adjacency Matrix Markov Chains
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
Antonio Robles-Kelly, Edwin R. Hancock
VISSYM
2007
13 years 7 months ago
Path Visualization for Adjacency Matrices
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far ...
Zeqian Shen, Kwan-Liu Ma
ICALP
2001
Springer
13 years 9 months ago
Testing Hypergraph Coloring
In this paper we initiate the study of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain prope...
Artur Czumaj, Christian Sohler
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
13 years 9 months ago
Spectral analysis of virus spreading in random geometric networks
— In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). The spreading of the viral process we consider in this paper is closely rela...
Victor M. Preciado, Ali Jadbabaie
IDEAL
2007
Springer
13 years 11 months ago
PINCoC : A Co-clustering Based Approach to Analyze Protein-Protein Interaction Networks
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
Clara Pizzuti, Simona E. Rombo