A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
This paper sets out a tracking framework, which is applied to the recovery of threedimensional hand motion from an image sequence. The method handles the issues of initialization,...
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
This letter addresses the problem of joint estimation of carrier frequency offset (CFO) and channel for OFDM systems in the presence of timing ambiguity. Based on two signal models...
Abstract. Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, i...