Sciweavers

1391 search results - page 160 / 279
» Complexity Limitations on Quantum Computation
Sort
View
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
14 years 2 days 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»
13 years 11 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»
13 years 10 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
EUROGRAPHICS
2010
Eurographics
14 years 3 months ago
Interactive High-Quality Visualization of Higher-Order Finite Elements
Higher-order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a ...
Markus Üffinger, Steffen Frey, Thomas Ertl
SOFTWARE
2011
13 years 3 months ago
Object-Oriented Parallelisation of Java Desktop Programs
Developing parallel applications is notoriously difficult, but is even more complex for desktop applications. The added difficulties are primarily because of their interactive nat...
Nasser Giacaman, Oliver Sinnen