Sciweavers

57 search results - page 6 / 12
» Closest point search in lattices
Sort
View
CLA
2007
13 years 8 months ago
Policies Generalization in Reinforcement Learning using Galois Partitions Lattices
The generalization of policies in reinforcement learning is a main issue, both from the theoretical model point of view and for their applicability. However, generalizing from a se...
Marc Ricordeau, Michel Liquiere
PR
2007
116views more  PR 2007»
13 years 6 months ago
GAPS: A clustering method using a new point symmetry-based distance measure
In this paper, an evolutionary clustering technique is described that uses a new point symmetry-based distance measure. The algorithm is therefore able to detect both convex and n...
Sanghamitra Bandyopadhyay, Sriparna Saha
GLOBECOM
2007
IEEE
14 years 1 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
3DIM
2003
IEEE
13 years 11 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
SIGGRAPH
2010
ACM
13 years 12 months ago
Line space gathering for single scattering in large scenes
We present an efficient technique to render single scattering in large scenes with reflective and refractive objects and homogeneous participating media. Efficiency is obtained...
Xin Sun, Kun Zhou, Stephen Lin, Baining Guo