5580 search results - page 147 / 1116 » Randomized priority algorithms |
AOSD
2007
ACM
15 years 2 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
APPROX
2006
Springer
15 years 1 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 ...
ALGORITHMICA
2010
14 years 10 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...
KDD
2003
ACM
15 years 10 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...
112
click to vote
MCS
2007
Springer
15 years 4 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...