5624 search results - page 217 / 1125 » On Conditional Covering Problem |
144
click to vote
MOC
2002
15 years 6 months ago
2002
An essential part of any boundary value problem is the domain on which the problem is defined. The domain is often given by scanning or another digital image technique with limited...
163
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We show that the exact recovery of sparse perturbations on the coefficient matrix in overdetermined Least Squares problems is possible for a large class of perturbation structure...
204
click to vote
ICDT
2007
ACM
16 years 22 days ago
2007
ACM
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
185
click to vote
AAAI
2006
15 years 8 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
158
click to vote
SIAMDM
2008
15 years 6 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...