5115 search results - page 4 / 1023 » On Randomized Lanczos Algorithms |
WAW
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
PODS
2012
ACM
11 years 9 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
SIAMCOMP
2012
11 years 9 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
With the help of index functions, we re-derive the ML(n)BiCGStab algorithm in [35] in a more systematic way. There are n ways to define the ML(n)BiCGStab residual vector. Each diff...
ICML
2009
IEEE
14 years 7 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...