6568 search results - page 162 / 1314 » Reducing the Complexity of Reductions |
166
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
Transform approximations are explored for speeding up the software compression of images and video. Faster approximations are used to replace the regular DCT whenever only few DCT...
176
click to vote
GECCO
2005
Springer
16 years 1 days ago
2005
Springer
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
163
click to vote
CARDIS
1998
Springer
15 years 10 months ago
1998
Springer
Wagner, Goldberg and Briceno have recently published an attack [2] on what they believe to be Comp128, the GSM A3A8 authentication hash function [1]. Provided that the attacker has...
142
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms...
192
click to vote
COCO
1991
Springer
15 years 10 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...