903 search results - page 13 / 181 » On the reduction of a random basis |
274
Voted
C3S2E
2011
ACM
14 years 5 months ago
2011
ACM
The LLL algorithm is a well-known and widely used lattice basis reduction algorithm. In many applications, its speed is critical. Parallel computing can improve speed. However, th...
173
click to vote
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— Lattice basis reduction is a powerful technique that enables a hard-output detector for a multiple-input multiple-output channel to approach maximum-likelihood performance with...
119
click to vote
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract—Due to their ability to model sequential data without making unnecessary independence assumptions, conditional random fields (CRFs) have become an increasingly popular ...
104
click to vote
ICITS
2009
14 years 11 months ago
2009
In this article, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computat...
135
click to vote
NDSS
2009
IEEE
15 years 8 months ago
2009
IEEE
Cross-site scripting (or XSS) has been the most dominant class of web vulnerabilities in 2007. The main underlying reason for XSS vulnerabilities is that web markup and client-sid...