7930 search results - page 422 / 1586 » Greedy in Approximation Algorithms |
146
click to vote
UAI
2001
15 years 8 months ago
2001
We present a new method for estimating the expected return of a POMDP from experience. The estimator does not assume any knowledge of the POMDP, can estimate the returns for finit...
191
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
182
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
We consider the problem of extracting informative exemplars from a data stream. Examples of this problem include exemplarbased clustering and nonparametric inference such as Gauss...
153
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Co-clustering can be viewed as a two-way (bilinear) factorization of a large data matrix into dense/uniform and possibly overlapping submatrix factors (co-clusters). This combinat...
194
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...