2314 search results - page 193 / 463 » Minimal Partitions of a Graph |
137
click to vote
MLDM
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
144
click to vote
ISMVL
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we propose a compact representation of logic functions using Multi-valued Decision Diagrams (MDDs) called heterogeneous MDDs. In a heterogeneous MDD, each variable ...
118
click to vote
ASPDAC
1999
ACM
15 years 8 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
132
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
162
Voted
EUROPAR
2008
Springer
15 years 5 months ago
2008
Springer
This work is devoted to the numerical resolution of the 4D Vlasov equation using an adaptive mesh of phase space. We previously proposed a parallel algorithm designed for distribut...