Sciweavers

2270 search results - page 34 / 454
» On the distribution of eigenvalues of graphs
Sort
View
JCM
2008
76views more  JCM 2008»
15 years 1 months ago
Waterfilling Estimation for AWGN MIMO Channel Modeled as a Random Matrix
Waterfilling solutions provide optimal power distribution in multiple-input multiple-output (MIMO) system design. However, the optimal distribution is usually obtained through cost...
Victor M. Vergara, Silvio E. Barbin, Ramiro Jordan
SPAA
2005
ACM
15 years 7 months ago
Peer-to-peer networks based on random transformations of connected regular undirected graphs
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
Peter Mahlmann, Christian Schindelhauer
CVPR
2008
IEEE
16 years 3 months ago
Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...
ICDCN
2011
Springer
14 years 5 months ago
A High-Level Framework for Distributed Processing of Large-Scale Graphs
Distributed processing of real-world graphs is challenging due to their size and the inherent irregular structure of graph computations. We present HIPG, a distributed framework th...
Elzbieta Krepska, Thilo Kielmann, Wan Fokkink, Hen...
GLOBECOM
2007
IEEE
15 years 8 months ago
Improving Connectivity via Relays Deployment in Wireless Sensor Networks
Abstract— Enhancing the connectivity of wireless sensor networks is necessary to avoid the occurrence of coverage gaps. In this paper, we aim at improving the network connectivit...
Ahmed S. Ibrahim, Karim G. Seddik, K. J. Ray Liu