521 search results - page 73 / 105 » Coring method for clustering a graph |
141
click to vote
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
—In this paper we present a procedure for solving quantified boolean formulas (QBF), which uses And-Inverter Graphs (AIGs) as the core data-structure. We make extensive use of s...
130
click to vote
IAT
2008
IEEE
15 years 10 months ago
2008
IEEE
Communication networks, such as networks formed by phone calls and email communications, can be modeled as dynamic graphs with vertices representing agents and edges representing ...
213
click to vote
PAMI
2012
13 years 6 months ago
2012
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
177
click to vote
ANTSW
2004
Springer
15 years 8 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
136
click to vote
JMLR
2006
15 years 4 months ago
2006
An essential step in designing a new computer architecture is the careful examination of different design options. It is critical that computer architects have efficient means by ...