Sciweavers

1922 search results - page 125 / 385
» ie 2007
Sort
View
113
Voted
PROVSEC
2007
Springer
15 years 6 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
SAFECOMP
2007
Springer
15 years 6 months ago
Software Encoded Processing: Building Dependable Systems with Commodity Hardware
In future, the decreasing feature size and the reduced power supply will make it much more difficult to built reliable microprocessors. Economic pressure will most likely result in...
Ute Wappler, Christof Fetzer
107
Voted
SARA
2007
Springer
15 years 6 months ago
Reformulating Constraint Satisfaction Problems to Improve Scalability
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...
96
Voted
SARA
2007
Springer
15 years 6 months ago
Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...
Ian P. Gent, Ian Miguel, Andrea Rendl
94
Voted
SAS
2007
Springer
111views Formal Methods» more  SAS 2007»
15 years 6 months ago
Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis
Abstract. Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. Ho...
Ben Hardekopf, Calvin Lin