Sciweavers

6138 search results - page 190 / 1228
» High performance computing through parallel processing
Sort
View
113
Voted
DCC
2004
IEEE
16 years 3 months ago
Discrete Universal Filtering Through Incremental Parsing
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinb...
167
Voted
ASSETS
2010
ACM
14 years 10 months ago
Broadening accessibility through special interests: a new approach for software customization
Individuals diagnosed with autism spectrum disorder (ASD) often fixate on narrow, restricted interests. These interests can be highly motivating, but they can also create attentio...
Robert R. Morris, Connor R. Kirschbaum, Rosalind W...
101
Voted
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
15 years 9 months ago
Parallel FFT computation with a CDMA-based network-on-chip
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...
Daewook Kim, Manho Kim, Gerald E. Sobelman
MVA
1992
15 years 4 months ago
Contour Map Reconstruction via Multi-Module Parallel Computational Scheme
Module-1 :Computation of gradient directions. Reconstruction of a set of imperfect contour curves which is extracted :Assignment of discreteheight to contourcurves. from a topograp...
Miyuki Kawashima, Ryuji Tokunaga, Yuzo Hirai
HPCA
1997
IEEE
15 years 7 months ago
Global Address Space, Non-Uniform Bandwidth: A Memory System Performance Characterization of Parallel Systems
Many parallel systems offer a simple view of memory: all storage cells are addresseduniformly. Despite a uniform view of the memory, the machines differsignificantly in theirmemo...
Thomas Stricker, Thomas R. Gross