Sciweavers

56 search results - page 1 / 12
» Engineering a scalable high quality graph partitioner
Sort
View
IPPS
2010
IEEE
13 years 2 months ago
Engineering a scalable high quality graph partitioner
Manuel Holtgrewe, Peter Sanders, Christian Schulz
SPAA
1997
ACM
13 years 9 months ago
HARP: A Fast Spectral Partitioner
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
Horst D. Simon, Andrew Sohn, Rupak Biswas
CN
2007
90views more  CN 2007»
13 years 4 months ago
A scalable solution for engineering streaming traffic in the future Internet
As traffic on the Internet continues to grow exponentially, there is a real need to solve scalability and traffic engineering simultaneously — specifically, without using over-p...
Mario Baldi, Guido Marchetto, Yoram Ofek
ICMCS
2009
IEEE
102views Multimedia» more  ICMCS 2009»
13 years 2 months ago
Scalable HMM based inference engine in large vocabulary continuous speech recognition
Parallel scalability allows an application to efficiently utilize an increasing number of processing elements. In this paper we explore a design space for parallel scalability for...
Jike Chong, Kisun You, Youngmin Yi, Ekaterina Goni...
SDM
2012
SIAM
297views Data Mining» more  SDM 2012»
11 years 7 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ç,...