3456 search results - page 323 / 692 » Algorithms for Interface Synthesis |
182
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
Achieving design closure is one of the biggest headaches for modern VLSI designers. This problem is exacerbated by high-level design automation tools that ignore increasingly impo...
232
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
169
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
168
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
A central problem in the analysis of motion capture (Mo-
Cap) data is how to decompose motion sequences into primitives.
Ideally, a description in terms of primitives should
fac...
158
click to vote
DATE
2008
IEEE
16 years 1 months ago
2008
IEEE
Synchronous Data Flow Graphs (SDFGs) have proved to be a very successful tool for modeling, analysis and synthesis of multimedia applications targeted at both single- and multiproc...