1952 search results - page 171 / 391 » Complete partitions of graphs |
178
click to vote
JMLR
2010
14 years 11 months ago
2010
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
105
click to vote
VLSID
2002
IEEE
16 years 5 months ago
2002
IEEE
A control part ? data path partition based sequential circuit verification scheme aimed at avoiding state explosion comprises two major modules namely, a data path verifier and a ...
123
click to vote
ICCAD
2001
IEEE
16 years 1 months ago
2001
IEEE
SPFDs are a mechanism to express flexibility in Boolean networks. Introduced by Yamashita et al. in the context of FPGA synthesis [4], they were extended later to general combina...
106
click to vote
KES
2004
Springer
15 years 10 months ago
2004
Springer
Automatizing the merging of knowledgebases is an important step towards more efficient knowledge management. The cases when two knowledgebases need to be merged completely into a m...
139
click to vote
SIGMOD
1996
ACM
15 years 8 months ago
1996
ACM
We introduce the problem of mining association rules in large relational tables containing both quantitative and categorical attributes. An example of such an association might be...