6105 search results - page 229 / 1221 » A Parallel Algorithm for Bound-Smoothing |
183
click to vote
SIGMOD
1997
ACM
15 years 10 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
178
click to vote
ICPP
1997
IEEE
15 years 10 months ago
1997
IEEE
r The lack of a versatile software tool for parallel program development has been one of the major obstacles for exploiting the potential of high-performance architectures. In this...
200
click to vote
ESA
1999
Springer
15 years 10 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
173
click to vote
DMIN
2006
15 years 7 months ago
2006
This paper presents enhancements to previous algorithms for the sequential extraction of complete non-redundant set of rules from a concept lattice. The aim of these enhancements i...
189
click to vote
VIS
2007
IEEE
16 years 7 months ago
2007
IEEE
Pipeline architectures provide a versatile and efficient mechanism for constructing visualizations, and they have been implemented in numerous libraries and applications over the p...