1951 search results - page 275 / 391 » An algorithm for improving graph partitions |
146
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysi...
289
click to vote
GECCO
2011
Springer
14 years 8 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
132
click to vote
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
130
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
122
click to vote
HT
2009
ACM
15 years 11 months ago
2009
ACM
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...