Sciweavers

6939 search results - page 569 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
CCGRID
2010
IEEE
15 years 7 months ago
Topology Aggregation for E-science Networks
Abstract--We propose several algorithms for topology aggregation (TA) to effectively summarize large-scale networks. These TA techniques are shown to significantly better for path ...
Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni
DCOSS
2011
Springer
14 years 6 months ago
Construction of connected dominating sets in large-scale MANETs exploiting self-stabilization
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
Stefan Unterschutz, Volker Turau
FCCM
2005
IEEE
132views VLSI» more  FCCM 2005»
15 years 12 months ago
Hardware Factorization Based on Elliptic Curve Method
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is ...
Martin Simka, Jan Pelzl, Thorsten Kleinjung, Jens ...
SDM
2012
SIAM
297views Data Mining» more  SDM 2012»
13 years 8 months ago
A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis
The Knowledge Discovery Toolbox (KDT) enables domain experts to perform complex analyses of huge datasets on supercomputers using a high-level language without grappling with the ...
Adam Lugowski, David M. Alber, Aydin Buluç,...
SAC
2010
ACM
16 years 1 months ago
Extraction of component-environment interaction model using state space traversal
Scalability of software engineering methods can be improved by application of the methods to individual components instead of complete systems. This is, however, possible only if ...
Pavel Parizek, Nodir Yuldashev