The set system of all arithmetic progressions on [n] is known to have a discrepancy of order n1/4. We investigate the discrepancy for the set system S3 n formed by all sums of thr...
An antichain is a collection of sets in which no two sets are comparable under set inclusion. An antichain A is flat if there exists an integer k 0 such that every
This paper presents a novel formulation and approach to the minimal document set retrieval problem. Minimal Document Set Retrieval (MDSR) is a promising information retrieval task...
In modern application domains such as multimedia, molecular biology and medical imaging, similarity search in database systems is becoming an increasingly important task. Especial...
Hans-Peter Kriegel, Stefan Brecheisen, Peer Kr&oum...
Set expansion refers to expanding a given partial set of objects into a more complete set. A well-known example system that does set expansion using the web is Google Sets. In thi...