2745 search results - page 90 / 549 » A fast algorithm for computing large Fibonacci numbers |
132
Voted
HPCA
2002
IEEE
16 years 4 months ago
2002
IEEE
Cyclops is a new architecture for high performance parallel computers being developed at the IBM T. J. Watson Research Center. The basic cell of this architecture is a single-chip...
112
Voted
ICMS
2010
15 years 1 months ago
2010
Abstract. Minimizing the evaluation cost of a polynomial expression is a fundamental problem in computer science. We propose tools that, for a polynomial P given as the sum of its ...
119
Voted
SOFSEM
2010
Springer
16 years 14 days ago
2010
Springer
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
168
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
128
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...