2745 search results - page 49 / 549 » A fast algorithm for computing large Fibonacci numbers |
125
Voted
JCSS
2010
15 years 1 months ago
2010
Convolution y(t) = a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, wh...
139
click to vote
GD
2006
Springer
15 years 7 months ago
2006
Springer
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
142
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
163
Voted
ICAPR
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
134
Voted
CIS
2006
Springer
15 years 7 months ago
2006
Springer
Many Multi-Objective Evolutionary Algorithms (MOEAs) have been proposed in recent years. However, almost all MOEAs have been evaluated on problems with two to four objectives only...