61 search results - page 5 / 13 » Tree Decomposition with Applications to Constraint Processin... |
ISMIS
2000
Springer
14 years 6 days ago
2000
Springer
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
PODS
2007
ACM
14 years 8 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
TPDS
2008
13 years 8 months ago
2008
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
DSD
2006
IEEE
14 years 2 months ago
2006
IEEE
We propose a novel two-level Boolean minimizer coming in succession to our previously developed minimizer BOOM, so we have named it BOOM-II. It is a combination of two minimizers,...