Sciweavers

3894 search results - page 199 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ICANN
2007
Springer
15 years 10 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel
PPSC
1993
15 years 7 months ago
Parallel Preconditioning and Approximate Inverses on the Connection Machine
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...
Marcus J. Grote, Horst D. Simon
ICIAR
2010
Springer
15 years 11 months ago
Structural Similarity-Based Approximation of Signals and Images Using Orthogonal Bases
The structural similarity (SSIM) index has been shown to be an useful tool in a wide variety of applications that involve the assessment of image quality and similarity. However, i...
Dominique Brunet, Edward R. Vrscay, Zhou Wang
ATAL
2010
Springer
15 years 1 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
IJIT
2004
15 years 8 months ago
Multiresolution Approach to Subpixel Registration by Linear Approximation of PSF
Linear approximation of point spread function (PSF) is a new method for determining subpixel translations between images. The problem with the actual algorithm is the inability of ...
Erol Seke, Kemal Özkan