28888 search results - page 30 / 5778 » Computability and complexity in analysis |
SACRYPT
2001
Springer
15 years 4 months ago
2001
Springer
Linear cryptanalysis remains the most powerful attack against DES at this time. Given 243 known plaintext-ciphertext pairs, Matsui expected a complexity of less than 243 DES evalua...
118
click to vote
ICA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Mutual information (MI) is a common criterion in independent component analysis (ICA) optimization. MI is derived from probability density functions (PDF). There are scen...
CSC
2008
15 years 1 months ago
2008
Complex network models such as Kauffman's NK model have been shown to have interesting phase transitional properties as the connectivity is varied. Conventional network and g...
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
ICDAR
2009
IEEE
15 years 6 months ago
2009
IEEE
We have proposed a complete system for text detection and localization in gray scale scene images. A boosting framework integrating feature and weak classifier selection based on...