1331 search results - page 52 / 267 » Complexity bounds for zero-test algorithms |
SIAMMAX
2011
13 years 2 months ago
2011
We introduce a methodology for obtaining inventories of error results for families of numerical dense linear algebra algorithms. The approach for deriving the analyses is goal-orie...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
EUROCRYPT
2001
Springer
14 years 7 days ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
ICIP
1997
IEEE
14 years 9 months ago
1997
IEEE
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...