210 search results - page 33 / 42 » An analysis of reinforcement learning with function approxim... |
101
Voted
ISM
2008
IEEE
15 years 6 months ago
2008
IEEE
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Many real world data are sampled functions. As shown by Functional Data Analysis (FDA) methods, spectra, time series, images, gesture recognition data, etc. can be processed more e...
107
click to vote
KDD
2004
ACM
16 years 2 days ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
100
click to vote
AAAI
2010
15 years 1 months ago
2010
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...