Sciweavers

340 search results - page 57 / 68
» Kernelized value function approximation for reinforcement le...
Sort
View
SASO
2008
IEEE
15 years 8 months ago
Self-Adaptive Dissemination of Data in Dynamic Sensor Networks
The distribution of data in large dynamic wireless sensor networks presents a difficult problem due to node mobility, link failures, and traffic congestion. In this paper, we pr...
David Dorsey, Bjorn Jay Carandang, Moshe Kam, Chri...
162
Voted
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
13 years 4 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
134
Voted
CVPR
2008
IEEE
16 years 4 months ago
Transfer learning for image classification with sparse prototype representations
To learn a new visual category from few examples, prior knowledge from unlabeled data as well as previous related categories may be useful. We develop a new method for transfer le...
Ariadna Quattoni, Michael Collins, Trevor Darrell
169
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Using the kernel trick in compressive sensing: Accurate signal recovery from fewer measurements
Compressive sensing accurately reconstructs a signal that is sparse in some basis from measurements, generally consisting of the signal’s inner products with Gaussian random vec...
Hanchao Qi, Shannon Hughes
112
Voted
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 3 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
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-...
Kenneth L. Clarkson