2745 search results - page 349 / 549 » A fast algorithm for computing large Fibonacci numbers |
151
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
133
click to vote
ICCD
2007
IEEE
16 years 2 months ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
130
click to vote
VLDB
1998
ACM
15 years 9 months ago
1998
ACM
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hi...
160
click to vote
DAS
2010
Springer
15 years 9 months ago
2010
Springer
Conventional optical character recognition (OCR) systems operate on individual characters and words, and do not normally exploit document or collection context. We describe a Coll...
142
click to vote
RECOMB
2005
Springer
16 years 5 months ago
2005
Springer
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...