1382 search results - page 108 / 277 » Term ordering problem on MDG |
DAC
2005
ACM
16 years 1 months ago
2005
ACM
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
100
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
The aim of data mining is to find novel and actionable insights in data. However, most algorithms typically just find a single (possibly non-novel/actionable) interpretation of th...
113
click to vote
STOC
2006
ACM
16 years 1 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
ICCAD
2005
IEEE
15 years 10 months ago
2005
IEEE
Technology mapping based on DAG-covering suffers from the problem of structural bias: the structure of the mapped netlist depends strongly on the subject graph. In this paper we ...
104
click to vote
WWW
2009
ACM
15 years 7 months ago
2009
ACM
We propose a novel cost-efficient approach to threshold selection for binary web-page classification problems with imbalanced class distributions. In many binary-classification ta...