16404 search results - page 2416 / 3281 » A set coverage problem |
244
click to vote
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
184
click to vote
SIAMSC
2010
15 years 6 months ago
2010
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
210
click to vote
SIGOPS
2010
15 years 6 months ago
2010
Despite advances in the application of automated statistical and machine learning techniques to system log and trace data there will always be a need for human analysis of machine...
246
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Update summarization aims to create a summary over a topic-related multi-document dataset based on the assumption that the user has already read a set of earlier documents of the ...
218
click to vote
COLT
2010
Springer
15 years 5 months ago
2010
Springer
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...