183 search results - page 14 / 37 » Analyzing graph structure via linear measurements |
ALGORITHMICA
2008
13 years 7 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...