4894 search results - page 300 / 979 » The Guarding Problem - Complexity and Approximation |
209
click to vote
IR
2010
15 years 5 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 ...
243
click to vote
PKDD
2010
Springer
15 years 4 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...
166
click to vote
SIAMJO
2011
15 years 1 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
178
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The notion of the 1-D analytic signal is well understood and has found many applications. At the heart of the analytic signal concept is the Hilbert transform. The problem in exte...
358
click to vote
JMLR
2012
13 years 9 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...