query: Indexing subsets of size k
positive_passages.docid: 146682
positive_passages.text: How to calculate the index (lexicographical order) when the combination is given
negative_passages.docid: 24312
negative_passages.text: Choosing optimal K for KNN
negative_passages.docid: 86902
negative_passages.text: Consider the smallest number in each of the $n\choose r$ subsets (of size $r$) of $S=\{1,2,\ldots,n\}$...
negative_passages.docid: 151620
negative_passages.text: Multidimensional indices in databases
negative_passages.docid: 103471
negative_passages.text: Efficient list intersection algorithm
negative_passages.docid: 117467
negative_passages.text: Using BIC to estimate the number of k in KMEANS
negative_passages.docid: 25769
negative_passages.text: Finding all posets on a set
negative_passages.docid: 89611
negative_passages.text: Combinations of selecting $n$ objects with $k$ different types
negative_passages.docid: 117658
negative_passages.text: A set with n elements has 2^n subsets
negative_passages.docid: 144821
negative_passages.text: Number of ordered pairs of subsets
negative_passages.docid: 68581
negative_passages.text: Combination for subset with duplicates
negative_passages.docid: 146204
negative_passages.text: Subsets sharing at most $i$ elements
negative_passages.docid: 111561
negative_passages.text: Distance of a point to a subset.
negative_passages.docid: 120095
negative_passages.text: How many ways to split n elements in k groups?
negative_passages.docid: 82207
negative_passages.text: Number of Pairs of Subsets
negative_passages.docid: 59530
negative_passages.text: Efficiently finding the intersection of a variable number of sets of strings
negative_passages.docid: 142467
negative_passages.text: Partitioning with varying partition size