Sciweavers

57 search results - page 5 / 12
» Closest point search in lattices
Sort
View
JC
2007
65views more  JC 2007»
13 years 7 months ago
Searching for extensible Korobov rules
Extensible lattice sequences have been proposed and studied in [5–7]. For the special case of extensible Korobov sequences, parameters can be found in [6]. The searches made to ...
Hardeep S. Gill, Christiane Lemieux
ICMCS
2006
IEEE
227views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Adaptive Dual AK-D Tree Search Algorithm for ICP Registration Applications
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...
Jiann-Der Lee, Shih-Sen Hsieh, Chung-Hsien Huang, ...
CEC
2010
IEEE
13 years 8 months ago
Meta-heuristic search and square Erickson matrices
A Ramsey theory problem, that can be seen as a 2 dimensional extension of the Van der Waerden theorem, was posed by Martin J. Erickson in his book [1]: "find the minimum n su...
Denis Robilliard, Amine M. Boumaza, Virginie Mario...
GLOBECOM
2009
IEEE
13 years 11 months ago
Near-ML Detection over a Reduced Dimension Hypersphere
Abstract--In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partition...
Jun Won Choi, Byonghyo Shim, Andrew C. Singer
ICIP
2000
IEEE
14 years 9 months ago
Fast Code Enhancement with Local Search for Fractal Image Compression
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
Raouf Hamzaoui, Dietmar Saupe, Michael Hiller