5115 search results - page 102 / 1023 » On Randomized Lanczos Algorithms |
116
Voted
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
120
Voted
ALGORITHMICA
2010
15 years 2 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
106
Voted
KDD
2003
ACM
16 years 3 months ago
2003
ACM
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
144
click to vote
MCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We report on our recent progress in developing an ensemble of classifiers based algorithm for addressing the missing feature problem. Inspired in part by the random subsp...
126
Voted
CAL
2008
15 years 2 months ago
2008
Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase thr...