5115 search results - page 78 / 1023 » On Randomized Lanczos Algorithms |
134
click to vote
PR
2008
15 years 6 months ago
2008
In this paper, we present a new background estimation algorithm which effectively represents both background and foreground. The problem is formulated with a labeling problem over...
161
click to vote
WAW
2004
Springer
15 years 11 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
145
click to vote
DEXA
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of data-stream classification, introducing a stream-classification algorithm, Dynamic Streaming Random Forests, that is able to handle evolving data streams...
164
click to vote
IPSN
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present a distributed algorithm for environmental monitoring of a scalar field (such as temperature, intensity of light, atmospheric pressure, etc.) using a random se...
142
click to vote
SPDP
1990
IEEE
15 years 10 months ago
1990
IEEE
Abstract. This article presents a randomized algorithm for leader election which uses bidirectionality of an asynchronous ring to force a node to "commit" to a coin flip ...