5115 search results - page 99 / 1023 » On Randomized Lanczos Algorithms |
153
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
120
click to vote
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
Activity recognition is an important issue in building intelligent monitoring systems. We address the recognition of multilevel activities in this paper via a conditional Markov r...
124
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
113
Voted
COCO
1994
Springer
15 years 6 months ago
1994
Springer
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
159
click to vote
Lecture Notes
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."