Now showing items 1-4 of 4
Dynamic multiple pattern matching
Pattern matching algorithms are among the most important and practical contribution of theoretical computer science. Pattern matching is used in a wide variety of applications such as text editing, information retrieval, ...
Efficient VLSI architectures for matrix factorizations
The SVD (Singular Value Decomposition) is a critical matrix factorization in many real-time computations from an application domain which includes signal processing and robotics; and complex data matrices are encountered ...
Very large-scale linear programming: A case study in exploiting both parallelism and distributed memory
There has been limited success with parallel implementations of both the simplex method and interior point methods for solving real-world linear programs. Experience with a parallel implementation of CPLEX, a state of the ...
Computation of eigenvalues for starlike domains
In this paper, we present a software tool for the computation of eigenvalues of starlike domains defined by polar boundary functions. We also offer and numerically test a conjecture on the monotonicity of the fundamental ...