Sciweavers

1236 search results - page 198 / 248
» Prefix-Like Complexities and Computability in the Limit
Sort
View
SIGGRAPH
1998
ACM
15 years 2 months ago
Subdivision Surfaces in Character Animation
The creation of believable and endearing characters in computer graphics presents a number of technical challenges, including the modeling, animation and rendering of complex shap...
Tony DeRose, Michael Kass, Tien Truong
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 1 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...
FCCM
2004
IEEE
118views VLSI» more  FCCM 2004»
15 years 1 months ago
Virtual Memory Window for a Portable Reconfigurable Cryptography Coprocessor
Reconfigurable System-on-Chip (SoC) platforms that incorporate hard-core processors surrounded by large amounts of FPGA are today commodities: the reconfigurable logic is often us...
Miljan Vuletic, Laura Pozzi, Paolo Ienne
DIMEA
2007
132views Multimedia» more  DIMEA 2007»
14 years 11 months ago
On the production of creative subjectivity
Businesses today are requiring higher levels of creativity and innovation in the face of rapid change, fierce competition and increasingly complex markets. Nowhere is the more obv...
Brett Rolfe

Book
352views
16 years 8 months ago
Object-Oriented Reengineering Patterns
"The documentation is missing or obsolete, and the original developers have departed. Your team has limited understanding of the system, and unit tests are missing for many, i...
Serge Demeyer, Stéphane Ducasse, Oscar Nierstrasz