536 search results - page 52 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
167
click to vote
ACISP
2010
Springer
15 years 4 months ago
2010
Springer
Many applications using cryptographic hash functions do not require collision resistance, but some kind of preimage resistance. That's also the reason why the widely used SHA-...
163
click to vote
AAAI
1994
15 years 7 months ago
1994
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
186
click to vote
SLSFS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Mutual Information (MI) is a long studied measure of information content, and many attempts to apply it to feature extraction and stochastic coding have been made. Howeve...
171
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
141
click to vote
FM
2008
Springer
15 years 7 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...