Sciweavers

1802 search results - page 198 / 361
» Sparse Computations with PEI
Sort
View
PPAM
2007
Springer
15 years 10 months ago
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
Fredrik Manne, Rob H. Bisseling
WACV
2005
IEEE
15 years 10 months ago
Multiplicative Background-Foreground Estimation Under Uncontrolled Illumination using Intrinsic Images
Instead of the conventional background and foreground definition, we propose a novel method that decomposes a scene into time-varying background and foreground intrinsic images. T...
Fatih Murat Porikli
IPPS
2003
IEEE
15 years 9 months ago
Parallel Direct Solution of Linear Equations on FPGA-Based Machines
The efficient solution of large systems of linear equations represented by sparse matrices appears in many tasks. LU factorization followed by backward and forward substitutions i...
Xiaofang Wang, Sotirios G. Ziavras
139
Voted
ARITH
1997
IEEE
15 years 8 months ago
Theory and applications for a double-base number system
In this paper we present a rigorous theoretical analysis of the main properties of a double base number system, using bases 2 and 3; in particular we emphasize the sparseness of t...
Vassil S. Dimitrov, Graham A. Jullien, William C. ...
COMPUTING
2007
103views more  COMPUTING 2007»
15 years 4 months ago
An algebraic approach for H-matrix preconditioners
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
S. Oliveira, F. Yang