Sciweavers

1185 search results - page 124 / 237
» The Equivalence of Sampling and Searching
Sort
View
IEICET
2006
55views more  IEICET 2006»
13 years 8 months ago
Inserting Points Uniformly at Every Instance
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 ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
PAMI
2006
233views more  PAMI 2006»
13 years 7 months ago
Model-Based Hand Tracking Using a Hierarchical Bayesian Filter
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,...
Björn Stenger, Arasanathan Thayananthan, Phil...
AICOM
2004
92views more  AICOM 2004»
13 years 7 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
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...
Berthe Y. Choueiry, Lin Xu
TWC
2008
137views more  TWC 2008»
13 years 7 months ago
Ml joint CFO and channel estimation in OFDM systems with timing ambiguity
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...
Jianwu Chen, Yik-Chung Wu, Shaodan Ma, Tung-Sang N...
DATESO
2010
150views Database» more  DATESO 2010»
13 years 6 months ago
Evolving Quasigroups by Genetic Algorithms
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...
Václav Snásel, Jiri Dvorský, ...