3068 search results - page 56 / 614 » Clustering with Multiple Graphs |
135
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
114
click to vote
CVPR
2003
IEEE
16 years 2 months ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
116
click to vote
PDPTA
2007
15 years 1 months ago
2007
Abstract - We have experienced in our distributed applications that the network is the main limiting factor for performances on clusters. Indeed clusters are cheap and it is easier...
ECCC
2006
15 years 14 days ago
2006
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
107
click to vote
SAC
2005
ACM
15 years 6 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...