4009 search results - page 122 / 802 » Clustering on Complex Graphs |
110
click to vote
ICMCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Image segmentation has been studied for many years. But what factors influence segmentation results indeed? Why some images are easy to be handled while the others are not? In thi...
164
click to vote
MOBIHOC
2002
ACM
16 years 3 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
114
Voted
CLOUD
2010
ACM
15 years 8 months ago
2010
ACM
Hermes is an optimization engine for large-scale enterprise e-mail services. Such services could be hosted by a virtualized e-mail service provider, or by dedicated enterprise dat...
115
Voted
ISI
2007
Springer
15 years 10 months ago
2007
Springer
Graph data represents relationships, connections, or affinities. Innocent relationships produce repeated, and so common, substructures in graph data. We present techniques for dis...
131
click to vote
DATE
2009
IEEE
15 years 10 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...