Sciweavers

868 search results - page 34 / 174
» A new approach for factorizing FSM's
Sort
View
IPPS
2003
IEEE
15 years 3 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
CORR
2010
Springer
108views Education» more  CORR 2010»
14 years 10 months ago
Mining The Successful Binary Combinations: Methodology and A Simple Case Study
The importance of finding the characteristics leading to either a success or a failure is one of the driving forces of data mining. The various application areas of finding succes...
Yuval Cohen
SWARM
2010
SPRINGER
231views Optimization» more  SWARM 2010»
15 years 3 months ago
Hybrid Particle Swarm and Conjugate Gradient Optimization Algorithm
Abstract. In this work we propose a different particle swarm optimization (PSO) algorithm that employs two key features of the conjugate gradient (CG) method. Namely, adaptive wei...
Abdallah Qteish, Mohammad Hamdan
BMCBI
2004
120views more  BMCBI 2004»
14 years 9 months ago
An approach to large scale identification of non-obvious structural similarities between proteins
Background: A new sequence independent bioinformatics approach allowing genome-wide search for proteins with similar three dimensional structures has been developed. By utilizing ...
Artem Cherkasov, Steven J. M. Jones
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
15 years 4 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson