Sciweavers

188 search results - page 13 / 38
» An Algorithm for Solving Systems of Linear Diophantine Equat...
Sort
View
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
14 years 1 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...
DAC
1997
ACM
13 years 11 months ago
Quadratic Placement Revisited
The “quadratic placement” methodology is rooted in [6] [14] [16] and is reputedly used in many commercial and in-house tools for placement of standard-cell and gate-array desi...
Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huan...
CIE
2005
Springer
13 years 9 months ago
Domain-Theoretic Formulation of Linear Boundary Value Problems
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
Dirk Pattinson
ADCM
1998
132views more  ADCM 1998»
13 years 7 months ago
Numerical solution of generalized Lyapunov equations
Two e cient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The rst one is a generalization of the Bartels{Stewart method...
Thilo Penzl
PVM
1999
Springer
13 years 12 months ago
Parallel Monte Carlo Algorithms for Sparse SLAE Using MPI
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
Vassil N. Alexandrov, Aneta Karaivanova