2314 search results - page 211 / 463 » Minimal Partitions of a Graph |
119
click to vote
JCT
2006
15 years 4 months ago
2006
Let V be a vector space of dimension v over a field of order q. The q-Kneser graph has the kdimensional subspaces of V as its vertices, where two subspaces and are adjacent if and...
129
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
137
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
148
click to vote
IEEEPACT
2009
IEEE
15 years 11 months ago
2009
IEEE
Industry is moving towards multi-core designs as we have hit the memory and power walls. Multi-core designs are very effective to exploit thread-level parallelism (TLP) but do not...
129
click to vote
IESS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract This paper presents an embedded system design toolchain for automatic generation of parallel code runnable on symmetric multiprocessor systems from an initial sequential s...