Sciweavers

4934 search results - page 886 / 987
» complexity 2008
Sort
View
DAM
2007
107views more  DAM 2007»
15 years 4 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
JPDC
2008
135views more  JPDC 2008»
15 years 4 months ago
Fast parallel GPU-sorting using a hybrid algorithm
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...
Erik Sintorn, Ulf Assarsson
135
Voted
JRTIP
2008
118views more  JRTIP 2008»
15 years 4 months ago
Custom parallel caching schemes for hardware-accelerated image compression
Abstract In an effort to achieve lower bandwidth requirements, video compression algorithms have become increasingly complex. Consequently, the deployment of these algorithms on Fi...
Su-Shin Ang, George A. Constantinides, Wayne Luk, ...
JSAC
2008
128views more  JSAC 2008»
15 years 4 months ago
Iterative frequency domain channel estimation for dft-precoded ofdm systems using in-band pilots
We consider two techniques of in-band frequency domain multiplexed (FDM) pilots using interleaved frequency domain multiple access (IFDMA) signal with a Chu sequence for DFT-precod...
Chan-Tong Lam, David D. Falconer, Florence Danilo-...
151
Voted
JSAC
2008
98views more  JSAC 2008»
15 years 4 months ago
Multiuser Detection of Sparsely Spread CDMA
Code-division multiple access (CDMA) is the basis of a family of advanced air interfaces in current and future generation networks. The benefits promised by CDMA have not been full...
Dongning Guo, Chih-Chun Wang