Sciweavers

145 search results - page 5 / 29
» Fast, Randomized Join-Order Selection - Why Use Transformati...
Sort
View
VTC
2007
IEEE
14 years 5 months ago
Mellin Transform Based Performance Analysis of FFH M-ary FSK Using Product Combining Against Partial Band Noise Jamming
— We propose a novel bit error ratio (BER) analysis technique for fast frequency hopping (FFH) assisted M-ary frequency shift keying (MFSK) using product combining (PC), when the...
Sohail Ahmed, Lie-Liang Yang, Lajos Hanzo
ICISP
2010
Springer
14 years 3 months ago
Classification of High-Resolution NMR Spectra Based on Complex Wavelet Domain Feature Selection and Kernel-Induced Random Forest
High-resolution nuclear magnetic resonance (NMR) spectra contain important biomarkers that have potentials for early diagnosis of disease and subsequent monitoring of its progressi...
Guangzhe Fan, Zhou Wang, Seoung Bum Kim, Chivalai ...
WDAG
2010
Springer
168views Algorithms» more  WDAG 2010»
13 years 9 months ago
Fast Randomized Test-and-Set and Renaming
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...
Dan Alistarh, Hagit Attiya, Seth Gilbert, Andrei G...
DAMON
2008
Springer
14 years 19 days ago
Fast scans and joins using flash drives
As access times to main memory and disks continue to diverge, faster non-volatile storage technologies become more attractive for speeding up data analysis applications. NAND flas...
Mehul A. Shah, Stavros Harizopoulos, Janet L. Wien...
ICPR
2008
IEEE
14 years 5 months ago
Very fast ellipse detection using GPU-based RHT
An approach to very rapid computation of one class of randomized Hough transform (RHT) using parallel processing capabilities of a programmable graphics processing unit is describ...
Jong Kwan Lee, Brian A. Wood, Timothy S. Newman