2270 search results - page 221 / 454 » On the distribution of eigenvalues of graphs |
190
click to vote
TKDE
2008
15 years 6 months ago
2008
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
192
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
156
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
208
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
211
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
The Knowledge Discovery Toolbox (KDT) enables domain experts to perform complex analyses of huge datasets on supercomputers using a high-level language without grappling with the ...