2745 search results - page 33 / 549 » A fast algorithm for computing large Fibonacci numbers |
111
click to vote
SPIRE
2000
Springer
15 years 6 months ago
2000
Springer
We present new search algorithms to detect the occurrences of any pattern from a given pattern set in a text, allowing in the occurrences a limited number of spurious text charact...
130
click to vote
EUROCRYPT
2006
Springer
15 years 7 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...
112
click to vote
DATAMINE
2006
15 years 3 months ago
2006
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
155
click to vote
ICCV
2005
IEEE
15 years 9 months ago
2005
IEEE
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
132
click to vote
ARITH
2005
IEEE
15 years 9 months ago
2005
IEEE
We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polyn...