Sciweavers

5595 search results - page 394 / 1119
» Comparing Subsumption Optimizations
Sort
View
IPPS
2005
IEEE
16 years 12 days ago
Performance Analysis of MPI Collective Operations
Previous studies of application usage show that the performance of collective communications are critical for high-performance computing and are often overlooked when compared to ...
Jelena Pjesivac-Grbovic, Thara Angskun, George Bos...
PKDD
2005
Springer
153views Data Mining» more  PKDD 2005»
16 years 9 days ago
A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
Marc Wörlein, Thorsten Meinl, Ingrid Fischer,...
DATE
2003
IEEE
87views Hardware» more  DATE 2003»
16 years 3 days ago
FPGA-Based Implementation of a Serial RSA Processor
In this paper we present an hardware implementation of the RSA algorithm for public-key cryptography. The RSA algorithm consists in the computation of modular exponentials on larg...
Antonino Mazzeo, Luigi Romano, Giacinto Paolo Sagg...
UML
2001
Springer
15 years 11 months ago
Using Alloy and UML/OCL to Specify Run-Time Configuration Management: A Case Study
: There are many different ways to specify the requirements of complex software systems, and the optimal methods often vary according to the problem domain. We apply and compare tw...
Geri Georg, Jores Bieman, Robert B. France
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
15 years 11 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye