4047 search results - page 210 / 810 » The Discrete Basis Problem |
133
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Trust is a crucial basis for interactions among parties in large, open systems. Yet, the scale and dynamism of such systems make it infeasible for each party to have a direct basi...
141
Voted
ESANN
2008
15 years 5 months ago
2008
Abstract. We consider the problem of learning an unknown (overcomplete) basis from an unknown sparse linear combination. Introducing the "sparse coding neural gas" algori...
137
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We consider signals and operators in finite dimension which have sparse time-frequency representations. As main result we show that an S-sparse Gabor representation in Cn with re...
148
click to vote
ML
2002
ACM
15 years 3 months ago
2002
ACM
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
124
Voted
ML
2002
ACM
15 years 3 months 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...