2743 search results - page 405 / 549 » Minimization of an M-convex Function |
182
click to vote
ACL
2006
15 years 7 months ago
2006
When training the parameters for a natural language system, one would prefer to minimize 1-best loss (error) on an evaluation set. Since the error surface for many natural languag...
143
click to vote
IOR
2007
15 years 5 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
163
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Visual dictionary learning and base (binary) classifier training are two basic problems for the recently most popular image categorization framework, which is based on t...
179
click to vote
DAGM
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
177
click to vote
AAAI
2007
15 years 8 months ago
2007
In designing Markov Decision Processes (MDP), one must define the world, its dynamics, a set of actions, and a reward function. MDPs are often applied in situations where there i...