Sciweavers

1612 search results - page 89 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
PVM
1997
Springer
15 years 6 months ago
Performance of CAP-Specified Linear Algebra Algorithms
The traditional approach to the parallelization of linear algebra algorithms such as matrix multiplication and LU factorization calls for static allocation of matrix blocks to proc...
Marc Mazzariol, Benoit A. Gennart, Vincent Messerl...
IPPS
2003
IEEE
15 years 7 months ago
A Fast Algorithm for the Exhaustive Analysis of 12-Nucleotide-Long DNA Sequences. Applications to Human Genomics
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
Vicente Arnau, Ignacio Marín
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
15 years 3 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
GCCB
2006
15 years 6 months ago
Accelerated microRNA-Precursor Detection Using the Smith-Waterman Algorithm on FPGAs
During the last few years more and more functionalities of RNA have been discovered that were previously thought of being carried out by proteins alone. One of the most striking di...
Patrick May, Gunnar W. Klau, Markus Bauer, Thomas ...
145
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano