995 search results - page 104 / 199 » Learning Useful Horn Approximations |
104
Voted
ML
2002
ACM
15 years 10 days ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
136
click to vote
UAI
2003
15 years 2 months ago
2003
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
122
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...
132
Voted
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
We describe an algorithm for similar-image search which
is designed to be efficient for extremely large collections of
images. For each query, a small response set is selected by...
ICIDS
2009
Springer
15 years 7 months ago
2009
Springer
This paper introduces PoliCultura, a project created by Politecnico di Milano for the Italian schools, which has just completed three years of deployment. Participating classes (wi...