7930 search results - page 428 / 1586 » Greedy in Approximation Algorithms |
177
click to vote
NIPS
2007
15 years 8 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
198
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
201
click to vote
SIAMSC
2008
15 years 6 months ago
2008
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...
278
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
197
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...