6 search results - page 1 / 2 » Computations of Uniform Recurrence Equations Using Minimal M... |
SIAMCOMP
2000
13 years 4 months ago
2000
We consider a system of uniform recurrence equations (URE) of dimension one. We show how its computation can be carried out using minimal memory size with several synchronous proc...
TCC
2007
Springer
13 years 11 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...
IWMM
2010
Springer
13 years 6 months ago
2010
Springer
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
SIROCCO
2008
13 years 6 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
UAI
1997
13 years 6 months ago
1997
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...