Sciweavers

719 search results - page 98 / 144
» Solving Sparse Linear Constraints
Sort
View
78
Voted
IPPS
2007
IEEE
15 years 5 months ago
A Parallel Hybrid Method of GMRES on GRID System
Grid computing focuses on making use of a very large amount of resources from a large-scale computing environment. It intends to deliver high-performance computing over distribute...
Ye Zhang, Guy Bergére, Serge G. Petiton
116
Voted
ECML
2007
Springer
15 years 5 months ago
Principal Component Analysis for Large Scale Problems with Lots of Missing Values
Abstract. Principal component analysis (PCA) is a well-known classical data analysis technique. There are a number of algorithms for solving the problem, some scaling better than o...
Tapani Raiko, Alexander Ilin, Juha Karhunen
IPPS
2006
IEEE
15 years 5 months ago
On the performance of parallel normalized explicit preconditioned conjugate gradient type methods
A new class of parallel normalized preconditioned conjugate gradient type methods in conjunction with normalized approximate inverses algorithms, based on normalized approximate f...
George A. Gravvanis, Konstantinos M. Giannoutakis
CINQ
2004
Springer
131views Database» more  CINQ 2004»
15 years 4 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
ECCV
2010
Springer
15 years 3 months ago
Error-tolerant Image Compositing
Abstract. Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and...