5624 search results - page 829 / 1125 » On Conditional Covering Problem |
131
click to vote
IGPL
2006
15 years 4 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
152
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Motivated by the lossy compression of an active-vision video stream, we consider the problem of finding the rate-distortion function of an arbitrarily varying source (AVS) compos...
161
click to vote
JCS
2008
15 years 4 months ago
2008
Randomized protocols for hiding private information can be regarded as noisy channels in the information-theoretic sense, and the inference of the concealed information can be reg...
153
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
132
click to vote
JIIS
2008
15 years 4 months ago
2008
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...