57 search results - page 2 / 12 » Closest point search in lattices |
ICPR
2008
IEEE
14 years 6 months ago
2008
IEEE
A framework for mapping a polar-like coordinate system to a non-rigid shape is presented. Using a graph pyramid, a binary shape is decomposed into connected parts, based on its st...
3DIM
2007
IEEE
13 years 11 months ago
2007
IEEE
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
TCOM
2010
13 years 3 months ago
2010
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
GLOBECOM
2009
IEEE
13 years 9 months ago
2009
IEEE
This paper introduces a new framework of the multiple-input multiple-output (MIMO) detection in iterative receivers. Unlike the conventional methods processing with symbol lattice,...