3875 search results - page 149 / 775 » Approximation algorithms for the 0-extension problem |
150
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
122
click to vote
ICDCS
2010
IEEE
15 years 8 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
163
click to vote
IR
2010
15 years 3 months ago
2010
Recently direct optimization of information retrieval (IR) measures becomes a new trend in learning to rank. Several methods have been proposed and the effectiveness of them has ...
204
click to vote
PKDD
2010
Springer
15 years 2 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
295
click to vote
JMLR
2012
13 years 7 months ago
2012
This paper considers additive factorial hidden Markov models, an extension to HMMs where the state factors into multiple independent chains, and the output is an additive function...