356 search results - page 18 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
119
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
ICMLA
2009
14 years 10 months ago
2009
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
ICCAD
2009
IEEE
14 years 10 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 ...
128
Voted
DM
2011
14 years 7 months ago
2011
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
103
click to vote
WABI
2009
Springer
15 years 7 months ago
2009
Springer
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...