2745 search results - page 43 / 549 » A fast algorithm for computing large Fibonacci numbers |
139
click to vote
COMGEO
2004
ACM
15 years 3 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
128
click to vote
ARITH
2009
IEEE
15 years 10 months ago
2009
IEEE
—The real Logarithmic Number System (LNS) allows fast and inexpensive multiplication and division but more expensive addition and subtraction as precision increases. Recent advan...
248
click to vote
CVIU
2011
14 years 10 months ago
2011
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
123
click to vote
EUROPAR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In modern parallel and distributed systems, the time for exchanging data is usually larger than that for computing elementary operations. Consequently, these communicatio...
121
Voted
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
The discrete cosine transform (DCT) is widely used in image/video coding standards. However, since most DCT coefficients will be quantized to zeros, a large number of redundant co...