115 search results - page 1 / 23 » Generating All Sets With Bounded Unions |
CPC
2008
14 years 10 months ago
2008
COCOA
2010
Springer
14 years 8 months ago
2010
Springer
A simplex spanned by a colored point set in Euclidean d-space is colorful if all vertices have distinct colors. The union of all full-dimensional colorful simplices spanned by a c...
118
click to vote
ETT
2000
14 years 10 months ago
2000
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
LATIN
2004
Springer
15 years 3 months ago
2004
Springer
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...