45 search results - page 4 / 9 » Minimal proper interval completions |
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
COMBINATORICA
2008
13 years 7 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
JMLR
2010
13 years 2 months ago
2010
We study losses for binary classification and class probability estimation and extend the understanding of them from margin losses to general composite losses which are the compos...
IPCO
2007
13 years 9 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...