Sciweavers

495 search results - page 78 / 99
» Approximation algorithms for budgeted learning problems
Sort
View
MM
2004
ACM
167views Multimedia» more  MM 2004»
15 years 3 months ago
Learning an image manifold for retrieval
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
Xiaofei He, Wei-Ying Ma, HongJiang Zhang
COMPGEOM
2011
ACM
14 years 1 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
ECML
1993
Springer
15 years 1 months ago
Complexity Dimensions and Learnability
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
Shan-Hwei Nienhuys-Cheng, Mark Polman
84
Voted
ATAL
2006
Springer
15 years 1 months ago
Predicting people's bidding behavior in negotiation
This paper presents a statistical learning approach to predicting people's bidding behavior in negotiation. Our study consists of multiple 2-player negotiation scenarios wher...
Ya'akov Gal, Avi Pfeffer
ECCV
2004
Springer
15 years 11 months ago
Multiple View Feature Descriptors from Image Sequences via Kernel Principal Component Analysis
Abstract. We present a method for learning feature descriptors using multiple images, motivated by the problems of mobile robot navigation and localization. The technique uses the ...
Jason Meltzer, Ming-Hsuan Yang, Rakesh Gupta, Stef...