681 search results - page 99 / 137 » General Polynomial Time Decomposition Algorithms |
ICCAD
2009
IEEE
13 years 8 months ago
2009
IEEE
Wire bonding is the most popular method to connect signals between dies in System-in-Package (SiP) design nowadays. Pad assignment, which assigns inter-die signals to die pads so ...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
KDD
2004
ACM
14 years 11 months ago
2004
ACM
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
AI
2010
Springer
13 years 11 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
PPDP
2010
Springer
13 years 8 months ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...