1538 search results - page 141 / 308 » Spectral Techniques in Graph Algorithms |
151
Voted
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
144
click to vote
WALCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
137
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
117
Voted
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
ASALSAN is a new algorithm for computing three-way DEDICOM, which is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or th...
113
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...