Sciweavers

858 search results - page 17 / 172
» One Is Enough!
Sort
View
PROVSEC
2007
Springer
14 years 2 months ago
Decryptable Searchable Encryption
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...
Thomas Fuhr, Pascal Paillier
ICRA
1993
IEEE
101views Robotics» more  ICRA 1993»
14 years 28 days ago
Measuring Complexity of Intelligent Machines
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...
Pedro U. Lima, George N. Saridis
ECAI
2006
Springer
14 years 15 days ago
Multi-Objective Propagation in Constraint Programming
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...
Emma Rollon, Javier Larrosa
MASCOTS
2004
13 years 10 months ago
Mining Performance Data from Sampled Event Traces
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,...
FTCS
1993
86views more  FTCS 1993»
13 years 10 months ago
Interval Availability Distribution Computation
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...
Gerardo Rubino, Bruno Sericola