537 search results - page 79 / 108 » A new upper bound for 3-SAT |
127
click to vote
IACR
2011
14 years 1 months ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
107
Voted
ICS
2010
Tsinghua U.
15 years 11 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
113
Voted
ICCAD
2003
IEEE
15 years 10 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
ISSAC
2009
Springer
15 years 8 months ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
ICC
2008
IEEE
15 years 8 months ago
2008
IEEE
—Underwater acoustic channel usually has low data rate, long propagation delay, severe multipath effect, and time varying fading. Cooperative transmission is a new wireless commu...