3791 search results - page 46 / 759 » Packing sets of patterns |
100
Voted
AUSDM
2008
Springer
15 years 1 months ago
2008
Springer
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
COCOON
2006
Springer
15 years 2 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
DAGSTUHL
2006
15 years 17 days ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
COLING
2000
15 years 16 days ago
2000
We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the fu...
112
click to vote
EC
2008
14 years 10 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...