Sciweavers

3837 search results - page 64 / 768
» Learning Approximate Consistencies
Sort
View
133
Voted
SOFSEM
2007
Springer
15 years 8 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach
ESA
2006
Springer
118views Algorithms» more  ESA 2006»
15 years 5 months ago
Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
ICASSP
2010
IEEE
15 years 2 months ago
Sound enhancement using sparse approximation with speclets
This paper addresses an innovative approach to informed enhancement of damaged sound. It uses sparse approximations with a learned dictionary of atoms modeling the main components...
Manuel Moussallam, Pierre Leveau, Si-Mohamed Aziz ...
EWRL
2008
15 years 3 months ago
Bayesian Reward Filtering
A wide variety of function approximation schemes have been applied to reinforcement learning. However, Bayesian filtering approaches, which have been shown efficient in other field...
Matthieu Geist, Olivier Pietquin, Gabriel Fricout
ICML
2010
IEEE
15 years 3 months ago
Interactive Submodular Set Cover
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
Andrew Guillory, Jeff Bilmes