Sciweavers

507 search results - page 32 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
MOBICOM
2012
ACM
11 years 10 months ago
Faster GPS via the sparse fourier transform
GPS is one of the most widely used wireless systems. A GPS receiver has to lock on the satellite signals to calculate its position. The process of locking on the satellites is qui...
Haitham Hassanieh, Fadel Adib, Dina Katabi, Piotr ...
CASC
2010
Springer
153views Mathematics» more  CASC 2010»
13 years 4 months ago
Implementing Data Parallel Rational Multiple-Residue Arithmetic in Eden
Abstract. Residue systems present a well-known way to reduce computation cost for symbolic computation. However most residue systems are implemented for integers or polynomials. Th...
Oleg Lobachev, Rita Loogen
ICPP
1996
IEEE
13 years 12 months ago
Polynomial-Time Nested Loop Fusion with Full Parallelism
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
Edwin Hsing-Mean Sha, Chenhua Lang, Nelson L. Pass...
IJHPCA
2010
84views more  IJHPCA 2010»
13 years 6 months ago
Operation Stacking for Ensemble Computations With Variable Convergence
Sparse matrix operations achieve only small fractions of peak CPU speeds because of the use of specialized, indexbased matrix representations, which degrade cache utilization by i...
Mehmet Belgin, Godmar Back, Calvin J. Ribbens
ICASSP
2008
IEEE
14 years 2 months ago
Simultaneous and fast 3D tracking of multiple faces in video by GPU-based stream processing
In this work, we implement a real-time visual tracker that targets the position and 3D pose of objects in video sequences, specifically faces. Using Stream Processors for perform...
Oscar Mateo Lozano, Kazuhiro Otsuka