199 search results - page 12 / 40 » Computationally and Algebraically Complex Finite Algebra Mem... |
56
Voted
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
We derive a new, two-dimensional nonseparable signal transform for computing the spectrum of spatial signals residing on a finite quincunx lattice. The derivation uses the connect...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
AB
2007
Springer
15 years 1 months ago
2007
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equations. ...
119
click to vote
TCC
2007
Springer
15 years 3 months ago
2007
Springer
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...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...