Sciweavers

6897 search results - page 277 / 1380
» Parallelization of Modular Algorithms
Sort
View
IPPS
1997
IEEE
15 years 7 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
IEEEHPCS
2010
15 years 1 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...
ASIACRYPT
2003
Springer
15 years 6 months ago
Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves
One of the recent thrust areas in research on hyperelliptic curve cryptography has been to obtain explicit formulae for performing arithmetic in the Jacobian of such curves. We con...
Pradeep Kumar Mishra, Palash Sarkar
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 3 months ago
Communication-avoiding parallel and sequential QR factorizations
We present parallel and sequential dense QR factorization algorithms that are optimized to avoid communication. Some of these are novel, and some extend earlier work. Communicatio...
James Demmel, Laura Grigori, Mark Hoemmen, Julien ...
ICPPW
2006
IEEE
15 years 9 months ago
Retargeting Image-Processing Algorithms to Varying Processor Grain Sizes
Embedded computing architectures can be designed to meet a variety of application specific requirements. However, optimized hardware can require compiler support to realize the po...
Sam Sander, Linda M. Wills