85 search results - page 6 / 17 » Worst Cases and Lattice Reduction |
ANTS
2010
Springer
13 years 11 months ago
2010
Springer
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— 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...
PATMOS
2007
Springer
14 years 1 months ago
2007
Springer
The deep submicron semiconductor technologies will make the worst-case design impossible, since they can not provide design margins that it requires. Research directions should go ...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
In recent years, random projection has been used as a valuable tool for performing dimensionality reduction of high dimensional data. Starting with the seminal work of Johnson and...