Sciweavers

7195 search results - page 606 / 1439
» On Computing Power
Sort
View
MOC
2002
149views more  MOC 2002»
15 years 6 months ago
Sparse squares of polynomials
We answer a question left open in an article of Coppersmith and Davenport which proved the existence of polynomials whose powers are sparse, and in particular polynomials whose squ...
John Abbott
TSP
2008
110views more  TSP 2008»
15 years 6 months ago
Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
In this paper, we present a powerful technique for the blind extraction of direct-sequence code-division multiple access (DS-CDMA) signals from convolutive mixtures received by an ...
Lieven De Lathauwer, Alexandre de Baynast
IEEEHPCS
2010
15 years 5 months ago
Novel performance optimization of large-scale discrete-event simulation on the Cell Broadband Engine
This paper presents a computing technique for efficient parallel simulation of large-scale discrete-event models on the IBM Cell Broadband Engine (CBE), which has one Power Proces...
Qi Liu, Gabriel A. Wainer, Ligang Lu, Michael Perr...
ICMCS
2009
IEEE
115views Multimedia» more  ICMCS 2009»
15 years 4 months ago
A framework to detect and classify activity transitions in low-power applications
Minimizing the number of computations a low-power device makes is important to achieve long battery life. In this paper we present a framework for a low-power device to minimize t...
Jeffrey Boyd, Hari Sundaram
CPHYSICS
2010
118views more  CPHYSICS 2010»
15 years 4 months ago
The multithreaded version of FORM
We present TFORM, the version of the symbolic manipulation system FORM that can make simultaneous use of several processors in a shared memory architecture. The implementation use...
M. Tentyukov, J. A. M. Vermaseren