1208 search results - page 22 / 242 » On Counting Generalized Colorings |
APPROX
2008
Springer
14 years 11 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...
73
Voted
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
—Motivated by the migration mechanisms of ecosystems, various extensions to biogeography-based optimization (BBO) are proposed. BBO is an original optimization method based on th...
157
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
DASFAA
2004
IEEE
15 years 1 months ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...