This paper discusses a new method for capturing the complete appearanceof both synthetic and realworld objects andscenes,representing this information, and then using this represe...
Steven J. Gortler, Radek Grzeszczuk, Richard Szeli...
As Dag Normann has recently shown, the fully abstract model for PCF of hereditarily sequential functionals is not -complete and therefore not continuous in the traditional terminol...
– Reducing power consumption through high-level synthesis has attracted a growing interest from researchers due to its large potential for power reduction. In this work we study ...
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 244 compression function invocations. Another attack generates pseudo-ne...