172 search results - page 7 / 35 » Improving the Time Complexity of Matsui's Linear Cryptanalys... |
114
click to vote
OPODIS
2001
15 years 1 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
ICML
2009
IEEE
16 years 13 days ago
2009
IEEE
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
DNA
2009
Springer
15 years 6 months ago
2009
Springer
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— High-rate space-time-frequency block codes (STFBC) are promising for achieving high bandwidth efficiency, low overhead and latency. Recently, a class of low-complexity STFBC m...
102
click to vote
STOC
1996
ACM
15 years 3 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...