2745 search results - page 213 / 549 » A fast algorithm for computing large Fibonacci numbers |
128
click to vote
FPL
2005
Springer
15 years 10 months ago
2005
Springer
Many image processing applications require fast convolution of an image with a set of large 2D filters. Field - Programmable Gate Arrays (FPGAs) are often used to achieve this go...
133
click to vote
MOBIHOC
2006
ACM
15 years 10 months ago
2006
ACM
A large number of practical sensing and actuating applications require immediate notification of rare but urgent events and also fast delivery of time sensitive actuation command...
142
click to vote
MOC
2011
14 years 7 months ago
2011
Abstract. We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perfo...
144
click to vote
ICS
2001
Tsinghua U.
15 years 9 months ago
2001
Tsinghua U.
A large logical register file is important to allow effective compiler transformations or to provide a windowed space of registers to allow fast function calls. Unfortunately, a l...
143
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
In many real-world classification problems the input contains a large number of potentially irrelevant features. This paper proposes a new Bayesian framework for determining the r...