Sciweavers

2607 search results - page 183 / 522
» Complete Functional Synthesis
Sort
View
SIGGRAPH
1996
ACM
15 years 8 months ago
The Lumigraph
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...
BIRTHDAY
2008
Springer
15 years 6 months ago
On Natural Non-dcpo Domains
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...
Vladimir Sazonov
ASPDAC
2005
ACM
109views Hardware» more  ASPDAC 2005»
15 years 9 months ago
Optimal module and voltage assignment for low-power
– 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 ...
Deming Chen, Jason Cong, Junjuan Xu
CPC
2004
98views more  CPC 2004»
15 years 3 months ago
And/Or Trees Revisited
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...
Brigitte Chauvin, Philippe Flajolet, Danièl...
FSE
2006
Springer
159views Cryptology» more  FSE 2006»
15 years 7 months ago
Collisions and Near-Collisions for Reduced-Round Tiger
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...
John Kelsey, Stefan Lucks