450 search results - page 22 / 90 » Satisfiability with Exponential Families |
ICALP
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This meth...
84
Voted
ICSE
2009
IEEE-ACM
15 years 4 months ago
2009
IEEE-ACM
Determining whether a set of features can be composed, or safe composition, is a hard problem in software product line engineering because the number of feature combinations can b...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
The Dirichlet compound multinomial (DCM) distribution, also called the multivariate Polya distribution, is a model for text documents that takes into account burstiness: the fact ...