4218 search results - page 24 / 844 » Complete sets of cooperations |
AAAI
2010
13 years 9 months ago
2010
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
MLQ
2007
13 years 7 months ago
2007
Assume that there is no quasi-measurable cardinal not greater than 2ω . We show that for a c.c.c. σ-ideal I with a Borel base of subsets of an uncountable Polish space, if A is a...
IALP
2009
13 years 5 months ago
2009
In this paper, we propose a modular cascaded approach to data driven dependency parsing. Each module or layer leading to the complete parse produces a linguistically valid partial...
GC
2012
Springer
12 years 3 months ago
2012
Springer
A cut [X, V − X] in a hypergraph with vertex-set V is the set of all edges that meet both X and V − X. Let sr(n) denote the minimum total size of any cover of the edges of the ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— We study the high-power asymptotic behavior of the sum-rate capacity of multi-user interference networks with an equal number of transmitters and receivers. We assume that each...