7015 search results - page 93 / 1403 » Approximation algorithms for co-clustering |
SODA
2000
ACM
13 years 10 months ago
2000
ACM
We consider the following two instances of the projective clustering problem: Given a set
SIAMCO
2002
13 years 8 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
SPIRE
2009
Springer
14 years 3 months ago
2009
Springer
Collaborative filtering (CF) shares information between users to provide each with recommendations. Previous work suggests using sketching techniques to handle massive data sets i...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
This paper presents an efficient method for approximation of temporal video data using linear Bezier fitting. For a given sequence of frames, the proposed method estimates the int...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer