33 search results - page 7 / 7 » A General Framework for Fast Co-clustering on Large Datasets... |
SIAMCOMP
2010
12 years 12 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
CIKM
2008
Springer
13 years 7 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
TMI
2010
12 years 12 months ago
2010
Within-subject analysis in fMRI essentially addresses two problems, the detection of brain regions eliciting evoked activity and the estimation of the underlying dynamics. In [1, 2...