Sciweavers

520 search results - page 50 / 104
» Reductions Between Expansion Problems
Sort
View
ICCV
2009
IEEE
15 years 1 months ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
NIPS
2008
13 years 10 months ago
Automatic online tuning for fast Gaussian summation
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
Vlad I. Morariu, Balaji Vasan Srinivasan, Vikas C....
ESWS
2010
Springer
13 years 7 months ago
The Semantic Gap of Formalized Meaning
Recent work in Ontology learning and Text mining has mainly focused on engineering methods to solve practical problem. In this thesis, we investigate methods that can substantially...
Sebastian Hellmann
CVPR
2008
IEEE
14 years 10 months ago
Large-scale manifold learning
This paper examines the problem of extracting lowdimensional manifold structure given millions of highdimensional face images. Specifically, we address the computational challenge...
Ameet Talwalkar, Sanjiv Kumar, Henry A. Rowley
ICML
2009
IEEE
14 years 9 months ago
Efficient learning algorithms for changing environments
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
Elad Hazan, C. Seshadhri