112 search results - page 11 / 23 » On the Homological Dimension of Lattices |
ECCC
2006
13 years 6 months ago
2006
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
A belief-propagation decoder for low-density lattice codes, which represents messages explicitly as a mixture of Gaussians functions, is given. In order to prevent the mixture elem...
FGR
2006
IEEE
14 years 23 days ago
2006
IEEE
We propose an Isometric Self-Organizing Map (ISOSOM) method for nonlinear dimensionality reduction, which integrates a Self-Organizing Map model and an ISOMAP dimension reduction ...
COMPGEOM
2008
ACM
13 years 8 months ago
2008
ACM
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
ASIACRYPT
2010
Springer
13 years 4 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...