Sciweavers

1248 search results - page 32 / 250
» On the Number of Birch Partitions
Sort
View
CATS
2006
15 years 3 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
125
Voted
JCO
2008
84views more  JCO 2008»
15 years 1 months ago
Partitioning a weighted partial order
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
Linda S. Moonen, Frits C. R. Spieksma
ICDM
2003
IEEE
71views Data Mining» more  ICDM 2003»
15 years 7 months ago
Tree-structured Partitioning Based on Splitting Histograms of Distances
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...
Longin Jan Latecki, Rajagopal Venugopal, Marc Sobe...
100
Voted
ISCAS
2008
IEEE
118views Hardware» more  ISCAS 2008»
15 years 8 months ago
Algorithm for parallel inverse halftoning using partitioning of Look-Up Table (LUT)
— The Look-Up Table (LUT) method for inverse halftoning is fast and computation-free technique employed to obtain good quality images. In this work we propose a new algorithm to ...
Umair F. Siddiqi, Sadiq M. Sait
IPPS
2003
IEEE
15 years 7 months ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
Herbert Walder, Christoph Steiger, Marco Platzner