![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Daniel Kifer 2 Daniel Kifer, Johannes Gehrke , Cristian Bucila , Walker White : How to quickly find a witness. PODS 2003 : 272-283 1 Cristian Bucila , Johannes Gehrke , Daniel Kifer, Walker White : DualMiner: a dual-pruning algorithm for itemsets with constraints. KDD 2002 : 42-51 ![]() DiSC'03 © 2003 Association for Computing Machinery |