2570 search results - page 23 / 514 » Fast Algorithms For The Computation Of Ranklets |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
EUROCRYPT
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSRbased s...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
— In many application of noise cancellation, the changes in signal characteristics could be quite fast. This requires the utilization of adaptive algorithms, which converge rapid...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— This paper proposes numerical algorithms for reducing the computational cost of semi-supervised and active learning procedures for visually guided mobile robots from O(M3 ) to ...
ISMVL
2002
IEEE
15 years 2 months ago
2002
IEEE
We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While ...