1027 search results - page 93 / 206 » Ordered Vertex Partitioning |
CIMCA
2008
IEEE
14 years 2 days ago
2008
IEEE
This paper analyses the advantages and disadvantages of the K-means algorithm and the DENCLUE algorithm. In order to realise the automation of clustering analysis and eliminate hu...
JCT
2006
13 years 10 months ago
2006
We prove that a conjecture of Fomin, Fulton, Li, and Poon, associated to ordered pairs of partitions, holds for many infinite families of such pairs. We also show that the bounded ...
SSDBM
2010
IEEE
14 years 3 months ago
2010
IEEE
We present a technique for organizing data in spatial databases with non-convex domains based on an automatic characterization using the medial-axis transform (MAT). We define a t...
IJAR
2008
13 years 10 months ago
2008
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize pa...
JCT
2006
13 years 10 months ago
2006
We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (non-intersecting) s...