463 search results - page 33 / 93 » A General Framework for Graph Sparsification |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
IV
2003
IEEE
14 years 1 months ago
2003
IEEE
As Resource Description Framework (RDF) reaches maturity, there is an increasing need for tools that support it. A common and natural representation for RDF data is a directed lab...
KDD
2004
ACM
14 years 1 months ago
2004
ACM
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
MOBIHOC
2012
ACM
11 years 10 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
WIOPT
2010
IEEE
13 years 6 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...