1146 search results - page 9 / 230 » Finite cupping sets |
FFA
2006
13 years 7 months ago
2006
We determine information sets for the generalized Reed-Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also ...
COMBINATORICS
2002
13 years 7 months ago
2002
If we compose sufficiently many random functions on a finite set, then the composite function will be constant. We determine the number of compositions that are needed, on average...
CONSTRAINTS
2007
13 years 7 months ago
2007
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Particle filters encode a time-evolving probability density by maintaining a random sample from it. Level sets represent closed curves as zero crossings of functions of two variab...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...