85 search results - page 16 / 17 » Decidability of Trajectory-Based Equations |
SAC
2008
ACM
13 years 7 months ago
2008
ACM
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
HYBRID
2009
Springer
14 years 2 months ago
2009
Springer
ion of discrete abstractions of arbitrary memory span for nonlinear sampled systems Gunther Reißig⋆ Technische Universit¨at Berlin, Fakult¨at Elektrotechnik und Informatik, He...
TCC
2007
Springer
14 years 1 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...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
SIGMETRICS
2010
ACM
14 years 15 days ago
2010
ACM
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing efficient job al...