Sciweavers

19320 search results - page 3548 / 3864
» On the complexity of computing determinants
Sort
View
JISE
2010
144views more  JISE 2010»
15 years 1 months ago
Variant Methods of Reduced Set Selection for Reduced Support Vector Machines
In dealing with large datasets the reduced support vector machine (RSVM) was proposed for the practical objective to overcome the computational difficulties as well as to reduce t...
Li-Jen Chien, Chien-Chung Chang, Yuh-Jye Lee
MMAS
2010
Springer
15 years 1 months 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 1 months 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 1 months 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 1 months 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...
« Prev « First page 3548 / 3864 Last » Next »