172 search results - page 6 / 35 » Improving the Time Complexity of Matsui's Linear Cryptanalys... |
NAACL
2003
15 years 1 months ago
2003
We present improvements to a greedy decoding algorithm for statistical machine translation that reduce its time complexity from at least cubic ( ¢¡¤£¦¥¨§ when applied na...
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
79
Voted
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...
TCOM
2008
14 years 11 months ago
2008
To improve performance of orthogonal frequency division multiplexing (OFDM) for fading channels, this paper proposes increasing frequency and time diversity using linear dispersion...
WABI
2009
Springer
15 years 6 months ago
2009
Springer
It becomes more and more important to search for similar structures from molecular 3-D structure databases in the structural biology of the post genomic era. Two molecules are said...