270 search results - page 17 / 54 » Partitioning into Sets of Bounded Cardinality |
CPC
2004
13 years 7 months ago
2004
Let C be a code of length n over an alphabet of q letters. A codeword y is called a descendant of a set of t codewords {x1 , . . . , xt } if yi {x1 i , . . . , xt i} for all i = ...
FM
2009
Springer
14 years 2 months ago
2009
Springer
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
ICMCS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...
COMBINATORICA
2007
13 years 7 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
A binary space partition (BSP) for a set of disjoint objects in Euclidean space is a recursive decomposition, where each step partitions the space (and some of the objects) along ...