678 search results - page 11 / 136 » Structural Properties of Sparse Graphs |
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
JSYML
2010
13 years 4 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
CVPR
2012
IEEE
12 years 15 days ago
2012
IEEE
The choice of the over-complete dictionary that sparsely represents data is of prime importance for sparse codingbased image super-resolution. Sparse coding is a typical unsupervi...
ICCS
2004
Springer
14 years 3 months ago
2004
Springer
This paper gives a theoretical framework for clustering a set of conceptual graphs characterized by sparse descriptions. The formed clusters are named in an intelligible manner thr...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...