Sciweavers

170 search results - page 18 / 34
» Solving Sparse Integer Linear Systems
Sort
View
PC
2002
158views Management» more  PC 2002»
13 years 9 months ago
On parallel block algorithms for exact triangularizations
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
Jean-Guillaume Dumas, Jean-Louis Roch
ORL
2006
105views more  ORL 2006»
13 years 9 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
INTERSPEECH
2010
13 years 4 months ago
Towards a robust face recognition system using compressive sensing
An application of compressive sensing (CS) theory in imagebased robust face recognition is considered. Most contemporary face recognition systems suffer from limited abilities to ...
Allen Y. Yang, Zihan Zhou, Yi Ma, Shankar Sastry
ACL
1994
13 years 11 months ago
Precise N-Gram Probabilities from Stochastic Context-Free Grammars
We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-gr...
Andreas Stolcke, Jonathan Segal
IMCSIT
2010
13 years 7 months ago
The experimental analysis of GMRES convergence for solution of Markov chains
The authors consider the impact of the structure of the matrix on the convergence behavior for the GMRES projection method for solving large sparse linear equation systems resultin...
Beata Bylina, Jaroslaw Bylina