2252 search results - page 371 / 451 » Lower Bounds for Dynamic Algorithms |
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We investigate the bit-search type irregular decimation algorithms that are used within LFSR-based stream ciphers. In particular, we concentrate on BSG and ABSG, and consider two ...
CCE
2004
13 years 8 months ago
2004
This paper presents some new concepts and procedures for financial risk management. To complement the use of value at risk a new concept, upside potential or opportunity value as ...
TCSV
2002
13 years 8 months ago
2002
A novel frequency-domain technique for image blocking artifact detection and reduction is presented in this paper. The algorithm first detects the regions of the image which presen...
FSTTCS
2010
Springer
13 years 7 months ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...