270 search results - page 8 / 54 » Partitioning into Sets of Bounded Cardinality |
APPML
2011
13 years 2 months ago
2011
The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...
ARSCOM
2007
13 years 7 months ago
2007
Consider a lottery scheme consisting of randomly selecting a winning t–set from a universal m–set, while a player participates in the scheme by purchasing a playing set of any...
DAM
2006
13 years 7 months ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
KDID
2004
13 years 9 months ago
2004
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
PR
2008
13 years 7 months ago
2008
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a ...