836 search results - page 112 / 168 » On the Complexity of Train Assignment Problems |
120
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
156
click to vote
ACML
2009
Springer
15 years 10 months ago
2009
Springer
Real-world face recognition systems are sometimes confronted with degraded face images, e.g., low-resolution, blurred, and noisy ones. Traditional two-step methods have limited per...
146
click to vote
ILP
2007
Springer
15 years 10 months ago
2007
Springer
In reinforcement learning problems, an agent has the task of learning a good or optimal strategy from interaction with his environment. At the start of the learning task, the agent...
144
click to vote
ICAPR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper addresses the clustering problem of hidden dynamical systems behind observed multivariate sequences by assuming an interval-based temporal structure in the seq...
124
Voted
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
Partial differential equations (PDEs) have been successfully applied to many computer vision and image processing problems. However, designing PDEs requires high mathematical skill...