As such, public-key encryption with keyword search (a.k.a PEKS or searchable encryption) does not allow the recipient to decrypt keywords i.e. encryption is not invertible. This pa...
In this paper we introduce a formalism which combines reliability and complexity as performance measures for Intelligent Machines. For a given desired reliability, di erent algori...
Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy...
The prominent role of the memory hierarchy as one of the major bottlenecks in achieving good program performance has motivated the search for ways of capturing the memory performa...
Ricardo Portillo, Diana Villa, Patricia J. Teller,...
Interval availability is a dependability measure defined by the fraction of time during which a system is in operation over a finite observation period. The computation of its d...