2774 search results - page 385 / 555 » Exploiting Deep Structure |
183
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
In this paper, we present a new technique for the e cient dynamic detection and removal of inactive clauses, i.e. clauses that do not a ect the solutions of interest of a Boolean ...
155
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
Code compression has been shown to be an effective technique to reduce code size in memory constrained embedded systems. It has also been used as a way to increase cache hit ratio...
168
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
A tool that automates the floating-point to fixed-point conversion (FFC) process for digital signal processing systems is described. The tool automatically optimizes fixed-point d...
163
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...
167
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
In this paper, we introduce a generic framework for semi-supervised kernel learning. Given pairwise (dis-)similarity constraints, we learn a kernel matrix over the data that respe...