2314 search results - page 50 / 463 » Minimal Partitions of a Graph |
113
Voted
PAMI
2006
15 years 22 days ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
ISCAS
1994
IEEE
15 years 4 months ago
1994
IEEE
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
109
Voted
ICTAI
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...
107
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
We present a new subgoal-based method for automatically creating useful skills in reinforcement learning. Our method identifies subgoals by partitioning local state transition gra...
111
Voted
CSR
2009
Springer
15 years 7 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...