1 Network Tomography via Compressed Sensing Mohammad H. Firooz, Student Member, IEEE, Sumit Roy, Fellow, IEEE, Electrical Engineering Department University of Washington, Seattle, WA, USA.

First Page		Document Content
Date: 2010-09-16 20:44:55 Graph Adjacency matrix Bipartite graph Shortest path problem Topology Expander graph Logical matrix Directed graph Bipartite double cover Graph theory Mathematics Matrices		1 Network Tomography via Compressed Sensing Mohammad H. Firooz, Student Member, IEEE, Sumit Roy, Fellow, IEEE, Electrical Engineering Department University of Washington, Seattle, WA, USA. Add to Reading List Source URL: www.ee.washington.edu Download Document from Source Website File Size: 207,66 KB Share Document on Facebook

	P ERSEUS 3: Visualizing and Interactively Mining Large-Scale Graphs Di Jin Ticha Sethapakdi DocID: 1pxJM - View Document
	Detecting Mars Surface Change Using Landmark Comparison Julian Panetta Mentor: Kiri Wagstaff DocID: 1oUqP - View Document
	Towards a Trichotomy for Quantified H-Coloring Barnaby Martin and Florent Madelaine Department of Computer Science, University of Durham, DH1 3LE, U.K. Abstract. Hell and Neˇsetˇril proved that DocID: 1oxu4 - View Document
	Graph Matching with Anchor Nodes: A Learning Approach Nan Hu Raif M. Rustamov Leonidas Guibas Stanford University DocID: 1lgua - View Document
	Stable and Informative Spectral Signatures for Graph Matching Nan Hu Raif M. Rustamov Leonidas Guibas Stanford University DocID: 1l9LV - View Document