Sciweavers

2270 search results - page 102 / 454
» On the distribution of eigenvalues of graphs
Sort
View
TIT
2002
83views more  TIT 2002»
15 years 7 months ago
Capacity and reliability function for small peak signal constraints
The capacity and the reliability function as the peak constraint tends to zero are considered for a discrete-time memoryless channel with peak constrained inputs. Prelov and van de...
Bruce Hajek, Vijay G. Subramanian
TIT
2008
84views more  TIT 2008»
15 years 6 months ago
A Note on Rate-Distortion Functions for Nonstationary Gaussian Autoregressive Processes
Source coding theorems and Shannon rate-distortion functions were studied for the discrete-time Wiener process by Berger and generalized to nonstationary Gaussian autoregressive p...
Robert M. Gray, Takeshi Hashimoto
DCOSS
2010
Springer
15 years 11 months ago
Fast Decentralized Averaging via Multi-scale Gossip
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
Konstantinos I. Tsianos, Michael G. Rabbat
SIAMDM
2010
114views more  SIAMDM 2010»
15 years 6 months ago
Rank-Based Attachment Leads to Power Law Graphs
Abstract. We investigate the degree distribution resulting from graph generation models based on rank-based attachment. In rank-based attachment, all vertices are ranked according ...
Jeannette Janssen, Pawel Pralat
RELMICS
2009
Springer
16 years 2 months ago
Collagories for Relational Adhesive Rewriting
We define collagories essentially as “distributive allegories without zero morphisms”, and show that they are sufficient for accommodating the relation-algebraic approach to ...
Wolfram Kahl