172 search results - page 12 / 35 » Improving the Time Complexity of Matsui's Linear Cryptanalys... |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Machining time is a major performance criterion when it comes to high speed machining. CAM software can help in estimating that time for a given strategy. But in practice, CAM pro...
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— We propose a low-complexity adaptive highresolution channel prediction algorithm for pilot symbol assisted orthogonal frequency division multiplexing (OFDM) systems. Th...
83
Voted
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
112
click to vote
ICC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
129
Voted
LICS
1997
IEEE
15 years 3 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...