670 search results - page 70 / 134 » Intractability and clustering with constraints |
CLUSTER
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
ILP
2005
Springer
15 years 3 months ago
2005
Springer
Clustering is a fundamental task in Spatial Data Mining where data consists of observations for a site (e.g. areal units) descriptive of one or more (spatial) primary units, possib...
IWPC
2000
IEEE
15 years 2 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
ASPDAC
1999
ACM
15 years 2 months ago
1999
ACM
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mappe...
106
click to vote
DAWAK
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...