Sciweavers

3837 search results - page 132 / 768
» Learning Approximate Consistencies
Sort
View
JMLR
2006
117views more  JMLR 2006»
15 years 4 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
ECCV
2008
Springer
16 years 6 months ago
Learning for Optical Flow Using Stochastic Optimization
Abstract. We present a technique for learning the parameters of a continuousstate Markov random field (MRF) model of optical flow, by minimizing the training loss for a set of grou...
Yunpeng Li, Daniel P. Huttenlocher
ICPR
2006
IEEE
16 years 5 months ago
Weakly Supervised Learning on Pre-image Problem in Kernel Methods
This paper presents a novel alternative approach, namely weakly supervised learning (WSL), to learn the pre-image of a feature vector in the feature space induced by a kernel. It ...
Weishi Zheng, Jian-Huang Lai, Pong Chi Yuen
FOCS
2005
IEEE
15 years 10 months ago
Mechanism Design via Machine Learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
CLOR
2006
15 years 8 months ago
Sequential Learning of Layered Models from Video
Abstract. A popular framework for the interpretation of image sequences is the layers or sprite model, see e.g. [1], [2]. Jojic and Frey [3] provide a generative probabilistic mode...
Michalis K. Titsias, Christopher K. I. Williams