481 search results - page 68 / 97 » Martin's game: a lower bound for the number of sets |
COMBINATORICS
1998
13 years 8 months ago
1998
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
We consider the problem of shape recovery for real world scenes, where a variety of global illumination (interreflections, subsurface scattering, etc.) and illumination defocus e...
CADE
2005
Springer
14 years 9 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a ...
QOSIP
2005
Springer
14 years 2 months ago
2005
Springer
The IEEE 802.11 standard currently does not offer support to exploit the unequal perceptual importance of multimedia bitstreams. All packets affected by channel errors, in fact, ...