Sciweavers

17541 search results - page 3185 / 3509
» Complexity in scalable computing
Sort
View
MMAS
2010
Springer
15 years 28 days ago
A Novel Method for Solving Multiscale Elliptic Problems with Randomly Perturbed Data
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...
Victor Ginting, Axel Målqvist, Michael Presh...
PE
2010
Springer
124views Optimization» more  PE 2010»
15 years 28 days ago
High-level approach to modeling of observed system behavior
Current computer systems and communication networks tend to be highly complex, and they typically hide their internal structure from their users. Thus, for selected aspects of cap...
Thomas Begin, Alexandre Brandwajn, Bruno Baynat, B...
SIAMCOMP
2010
88views more  SIAMCOMP 2010»
15 years 27 days ago
Hardness Amplification Proofs Require Majority
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
Ronen Shaltiel, Emanuele Viola
TCOM
2010
83views more  TCOM 2010»
15 years 26 days ago
Early-Elimination Modification for Priority-First Search Decoding
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm...
Shin-Lin Shieh, Po-Ning Chen, Yunghsiang S. Han, T...
TIP
2010
154views more  TIP 2010»
15 years 26 days ago
Efficient Fourier-Wavelet Super-Resolution
Super-resolution (SR) is the process of combining multiple aliased low-quality images to produce a high-resolution high-quality image. Aside from registration and fusion of low-res...
M. Dirk Robinson, Cynthia A. Toth, Joseph Y. Lo, S...
« Prev « First page 3185 / 3509 Last » Next »