Sciweavers

2745 search results - page 44 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
138
Voted
ANCS
2006
ACM
15 years 9 months ago
CAMP: fast and efficient IP lookup architecture
A large body of research literature has focused on improving the performance of longest prefix match IP-lookup. More recently, embedded memory based architectures have been propos...
Sailesh Kumar, Michela Becchi, Patrick Crowley, Jo...
BMCBI
2006
129views more  BMCBI 2006»
15 years 3 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
CONCURRENCY
1998
151views more  CONCURRENCY 1998»
15 years 3 months ago
A new parallel matrix multiplication algorithm on distributed-memory concurrent computers
We present a new fast and scalable matrix multiplication algorithm, called DIMMA Distribution-Independent Matrix Multiplication Algorithm, for block cyclic data distribution on ...
Jaeyoung Choi
119
Voted
ISCAPDCS
2003
15 years 4 months ago
On the Scalable Computation of Large Sets of Integrals
We consider efficient strategies for the parallel and distributed computation of large sets of multivariate integrals. These arise in many applications such as computational chem...
Elise de Doncker, Ajay K. Gupta, Laurentiu Cucos
ISSAC
2007
Springer
83views Mathematics» more  ISSAC 2007»
15 years 9 months ago
Parallel computation of the rank of large sparse matrices from algebraic K-theory
This paper deals with the computation of the rank and some integer Smith forms of a series of sparse matrices arising in algebraic K-theory. The number of non zero entries in the ...
Jean-Guillaume Dumas, Philippe Elbaz-Vincent, Pasc...