Sciweavers

2303 search results - page 139 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
ICPP
2000
IEEE
15 years 7 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
CLUSTER
2000
IEEE
15 years 7 months ago
Multi-Grid Acceleration of a SIMPLE-Based CFD-Code and Aspects of Parallelization
The present study treats the calculation of the continuous phase of a multiphase flow, i.e. the numerical solution of the equations for a turbulent incompressible flow. An exist...
Klaus Bernert, Thomas Frank, Hellfried Schneider, ...
146
Voted
IPPS
2000
IEEE
15 years 7 months ago
A General Parallel Simulated Annealing Library and its Application in Airline Industry
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
Georg Kliewer, Stefan Tschöke
FCCM
2005
IEEE
132views VLSI» more  FCCM 2005»
15 years 9 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 ...
110
Voted
DAC
2009
ACM
16 years 4 months ago
Multicore parallel min-cost flow algorithm for CAD applications
Computational complexity has been the primary challenge of many VLSI CAD applications. The emerging multicore and manycore microprocessors have the potential to offer scalable perf...
Yinghai Lu, Hai Zhou, Li Shang, Xuan Zeng