Sciweavers

432 search results - page 58 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
121
Voted
ICASSP
2009
IEEE
15 years 5 months ago
Generating high performance pruned FFT implementations
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and pa...
Franz Franchetti, Markus Püschel
DSS
2007
113views more  DSS 2007»
15 years 1 months ago
An associate constraint network approach to extract multi-lingual information for crime analysis
International crime and terrorism have drawn increasing attention in recent years. Retrieving relevant information from criminal records and suspect communications is important in...
Christopher C. Yang, Kar Wing Li
IJRR
2010
185views more  IJRR 2010»
15 years 9 days ago
FISST-SLAM: Finite Set Statistical Approach to Simultaneous Localization and Mapping
The solution to the problem of mapping an environment and at the same time using this map to localize (the simultaneous localization and mapping, SLAM, problem) is a key prerequis...
Bharath Kalyan, K. W. Lee, W. Sardha Wijesoma
JEI
2007
90views more  JEI 2007»
15 years 1 months ago
Low-complexity high-performance multiscale error diffusion technique for digital halftoning
Multiscale error diffusion (MED) is superior to conventional error diffusion algorithms as it can eliminate directional hysteresis completely. However, due to its frame-oriented p...
Yik-Hing Fung, Ka-Chun Lui, Yuk-Hee Chan
ISCC
2005
IEEE
119views Communications» more  ISCC 2005»
15 years 7 months ago
A Systematic Approach to Building High Performance Software-Based CRC Generators
—A framework for designing a family of novel fast CRC generation algorithms is presented. Our algorithms can ideally read arbitrarily large amounts of data at a time, while optim...
Michael E. Kounavis, Frank L. Berry