Sciweavers

528 search results - page 66 / 106
» A Parallel Version for the Propagation Algorithm
Sort
View
FOCS
1990
IEEE
15 years 6 months ago
Uniform Memory Hierarchies
We present several e cient algorithms for sorting on the uniform memory hierarchy UMH, introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and ne...
Bowen Alpern, Larry Carter, Ephraim Feig
143
Voted
AAAI
2010
15 years 3 months ago
g-Planner: Real-time Motion Planning and Global Navigation using GPUs
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...
Jia Pan, Christian Lauterbach, Dinesh Manocha
ICISC
2004
120views Cryptology» more  ICISC 2004»
15 years 3 months ago
Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
Sanjit Chatterjee, Palash Sarkar, Rana Barua
TASLP
2010
148views more  TASLP 2010»
14 years 9 months ago
Batch and Adaptive PARAFAC-Based Blind Separation of Convolutive Speech Mixtures
We present a frequency-domain technique based on PARAllel FACtor (PARAFAC) analysis that performs multichannel blind source separation (BSS) of convolutive speech mixtures. PARAFAC...
Dimitri Nion, Kleanthis N. Mokios, Nicholas D. Sid...
JCC
2010
113views more  JCC 2010»
15 years 26 days ago
MDLab: A molecular dynamics simulation prototyping environment
Molecular dynamics (MD) simulation involves solving Newton’s equations of motion for a system of atoms, by calculating forces and updating atomic positions and velocities over a...
Trevor M. Cickovski, Santanu Chatterjee, Jacob Wen...