644 search results - page 84 / 129 » Decomposition Complexity |
124
click to vote
MICRO
2005
IEEE
15 years 6 months ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
103
Voted
DAC
2008
ACM
16 years 1 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
VIIP
2001
15 years 1 months ago
2001
Graphics cards exercise increasingly more computing power and are highly optimized for high data transfer volumes. In contrast typical workstations perform badly when data exceeds...
105
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
105
click to vote
DIAGRAMS
2000
Springer
15 years 4 months ago
2000
Springer
This paper examines capacity limits in mental animation of static diagrams of mechanical systems and interprets these limits within current theories of working memory. I review emp...