Sciweavers

82 search results - page 3 / 17
» No four subsets forming an N
Sort
View
TIT
1998
102views more  TIT 1998»
14 years 10 months ago
On Characterization of Entropy Function via Information Inequalities
—Given n discrete random variables = fX1;111; Xng, associated with any subset of f1; 2; 111; ng, there is a joint entropy H(X ) where X = fXi:i 2 g. This can be viewed as a f...
Zhen Zhang, Raymond W. Yeung
COMBINATORICS
1998
91views more  COMBINATORICS 1998»
14 years 10 months ago
New Bounds for Union-free Families of Sets
: Following Frankl and F¨uredi [1] we say a family, F, of subsets of an n-set is weakly union-free if F does not contain four distinct sets A, B, C, D with A ∪ B = C ∪ D. If i...
Don Coppersmith, James B. Shearer
COMPGEOM
2004
ACM
15 years 4 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...
FFA
2008
93views more  FFA 2008»
14 years 11 months ago
A new class of monomial bent functions
We study the Boolean functions f :F2n F2, n = 6r, of the form f (x) = Tr(xd) with d = 22r + 2r + 1 and F2n . Our main result is the characterization of those for which f are b...
Anne Canteaut, Pascale Charpin, Gohar M. M. Kyureg...
ACL
2000
15 years 10 days ago
Minimally Supervised Morphological Analysis by Multimodal Alignment
This paper presents a corpus-based algorithm capable of inducing inflectional morphological analyses of both regular and highly irregular forms (such as broughtbring) from distrib...
David Yarowsky, Richard Wicentowski