2137 search results - page 68 / 428 » Experiments on Graph Clustering Algorithms |
DATE
2009
IEEE
15 years 5 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
PDP
2006
IEEE
15 years 4 months ago
2006
IEEE
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
85
Voted
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
87
Voted
CVPR
2005
IEEE
16 years 7 days ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
SAMOS
2009
Springer
15 years 4 months ago
2009
Springer
Tomography is a powerful technique for three-dimensional imaging, that deals with image reconstruction from a series of projection images, acquired along a range of viewing directi...