4009 search results - page 114 / 802 » Clustering on Complex Graphs |
131
Voted
UAI
2008
15 years 5 months ago
2008
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural cri...
117
Voted
JACM
2000
15 years 3 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
120
click to vote
IWPC
2005
IEEE
15 years 9 months ago
2005
IEEE
Changes of software systems are less expensive and less error-prone if they affect only one subsystem. Thus, clusters of artifacts that are frequently changed together are subsyst...
124
click to vote
ICCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The divisive MinMaxCut algorithm of Ding et al. [3] produces more accurate clustering results than existing document cluster methods. Multilevel algorithms [4, 1, 5, 7] h...
113
click to vote
COR
2008
15 years 3 months ago
2008
This paper presents two new mathematical formulations for the Point-Feature Cartographic Label Placement Problem (PFCLP ) and a new Lagrangean relaxation with clusters (LagClus) t...