8099 search results - page 709 / 1620 » Higher-Order Task Models |
185
click to vote
CIE
2006
Springer
15 years 11 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
213
click to vote
DAGM
2006
Springer
15 years 11 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...
200
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
Many data mining applications involve the task of building a model for predictive classification. The goal of such a model is to classify examples (records or data instances) into...
210
click to vote
NIPS
2008
15 years 8 months ago
2008
This paper studies global ranking problem by learning to rank methods. Conventional learning to rank methods are usually designed for `local ranking', in the sense that the r...
183
click to vote
NAACL
2003
15 years 8 months ago
2003
Conditional random fields for sequence labeling offer advantages over both generative models like HMMs and classifiers applied at each sequence position. Among sequence labeling...