5115 search results - page 520 / 1023 » On Randomized Lanczos Algorithms |
162
click to vote
STOC
1996
ACM
15 years 11 months ago
1996
ACM
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
141
click to vote
ICIP
1994
IEEE
15 years 11 months ago
1994
IEEE
Abstract--We develop and investigate several novel multiresolution algorithms for detecting coherent radar targets embedded in clutter. These multiresolution detectors exploit the ...
184
click to vote
DISCO
1993
15 years 11 months ago
1993
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
189
click to vote
AINA
2004
IEEE
15 years 10 months ago
2004
IEEE
Prior survey of RED algorithm deployment on multiqueue system with shared buffer was unfair and sensitive to congestion level by statically setting the parameters. In this paper, ...
153
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
In this paper, we propose a framework for isolating text regions from natural scene images. The main algorithm has two functions: it generates text region candidates, and it veriï...