1920 search results - page 109 / 384 » The Complexity of the A B C Problem |
292
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
168
click to vote
SIAMSC
2008
15 years 6 months ago
2008
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
151
click to vote
WADS
2007
Springer
16 years 16 days ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
175
click to vote
AIPS
2011
14 years 10 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
199
click to vote
C3S2E
2008
ACM
15 years 8 months ago
2008
ACM
This paper considers the problem of integer least squares, where the least squares solution is an integer vector, whereas the coefficient matrix is real. In particular, we discuss...