2738 search results - page 43 / 548 » The Frobenius Problem and Its Generalizations |
147
click to vote
SIAMJO
2010
14 years 10 months ago
2010
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
120
Voted
CIE
2007
Springer
15 years 10 months ago
2007
Springer
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
131
Voted
COLT
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...
126
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
125
click to vote
SAT
2009
Springer
15 years 10 months ago
2009
Springer
Recent work has shown the value of using unsatisfiable cores to guide maximum satisfiability algorithms (Max-SAT) running on industrial instances [5,9,10,11]. We take this concep...