Sciweavers

861 search results - page 86 / 173
» Faster integer multiplication
Sort
View
SODA
2012
ACM
235views Algorithms» more  SODA 2012»
12 years 19 days ago
Fast zeta transforms for lattices with few irreducibles
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
Andreas Björklund, Mikko Koivisto, Thore Husf...
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
12 years 19 days ago
Constructing high order elements through subspace polynomials
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
Qi Cheng, Shuhong Gao, Daqing Wan
CCGRID
2009
IEEE
14 years 5 months ago
Improving Parallel Write by Node-Level Request Scheduling
In a cluster of multiple processors or cpu-cores, many processes may run on each compute node. Each process tends to issue contiguous I/O requests for snapshot, checkpointing or s...
Kazuki Ohta, Hiroya Matsuba, Yutaka Ishikawa
ISVC
2009
Springer
14 years 4 months ago
DRONE: A Flexible Framework for Distributed Rendering and Display
The available rendering performance on current computers increases constantly, primarily by employing parallel algorithms using the newest many-core hardware, as for example multi-...
Michael Repplinger, Alexander Löffler, Dmitri...
ICMCS
2007
IEEE
159views Multimedia» more  ICMCS 2007»
14 years 4 months ago
Accelerating Mutual-Information-Based Linear Registration on the Cell Broadband Engine Processor
Emerging multi-core processors are able to accelerate medical imaging applications by exploiting the parallelism available in their algorithms. We have implemented a mutual-inform...
Moriyoshi Ohara, Hangu Yeo, Frank Savino, Giridhar...