2740 search results - page 150 / 548 » Approximating Component Selection |
131
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
100
click to vote
COMGEO
2010
ACM
15 years 3 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
130
click to vote
CHI
2005
ACM
16 years 3 months ago
2005
ACM
We introduce approximate query techniques for searching and analyzing two-dimensional data sets such as line or scatter plots. Our techniques allow users to explore a dataset by d...
129
click to vote
PLDI
2012
ACM
13 years 5 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
114
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...