486 search results - page 14 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
We introduce the problem of mining association rules in large relational tables containing both quantitative and categorical attributes. An example of such an association might be...
ICPPW
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— In the sporadic task model, a task is characterized by three parameters — an execution requirement, a relative deadline, and a period parameter — and has the interp...
IFIPTCS
2010
13 years 5 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
EAAI
2006
13 years 7 months ago
2006
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...