Sciweavers

107 search results - page 2 / 22
» Improved Balanced Incomplete Factorization
Sort
View
PARA
2004
Springer
13 years 10 months ago
Parallel Hybrid Sparse Solvers Through Flexible Incomplete Cholesky Preconditioning
Abstract. We consider parallel preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) for sparse linear system solution. We develop methods for construct...
Keita Teranishi, Padma Raghavan
ICALP
2005
Springer
13 years 10 months ago
A Better Approximation Ratio for the Vertex Cover Problem
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
George Karakostas
TIT
2010
103views Education» more  TIT 2010»
12 years 12 months ago
Knuth's balanced codes revisited
Abstract--In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of "1"s and "01"s, called balanced ...
Jos H. Weber, Kees A. Schouhamer Immink
JCM
2007
177views more  JCM 2007»
13 years 5 months ago
Collision Free MAC Protocols for Wireless Ad Hoc Networks based on BIBD Architecture
—Wireless Ad hoc networks represent a powerful telecommunication infrastructure that is being exploited for enabling general wireless networking connectivity for a variety of sig...
Pietro Camarda, Orazio Fiume
SBACPAD
2004
IEEE
124views Hardware» more  SBACPAD 2004»
13 years 6 months ago
Improving Parallel Execution Time of Sorting on Heterogeneous Clusters
The aim of the paper is to introduce techniques in order to optimize the parallel execution time of sorting on heterogeneous platforms (processors speeds are related by a constant...
Christophe Cérin, Michel Koskas, Hazem Fkai...