Sciweavers

7106 search results - page 1281 / 1422
» Restricted Complexity, General Complexity
Sort
View
155
Voted
OOPSLA
2007
Springer
15 years 10 months ago
Scalable omniscient debugging
Omniscient debuggers make it possible to navigate backwards in time within a program execution trace, drastically improving the task of debugging complex applications. Still, they...
Guillaume Pothier, Éric Tanter, José...
126
Voted
OOPSLA
2007
Springer
15 years 10 months ago
IAnticorruption: a domain-driven design approach to more robust integration
Custom House's new currency exchange system is integrated with a legacy system. After a few years of growth, the two systems were so intricately tangled that even small chang...
Sam Peng, Ying Hu
SACRYPT
2007
Springer
141views Cryptology» more  SACRYPT 2007»
15 years 10 months ago
Analysis of Countermeasures Against Access Driven Cache Attacks on AES
Cache attacks on implementations of cryptographic algorithms have turned out to be very powerful. Progress in processor design, e.g., like hyperthreading, requires to adapt models ...
Johannes Blömer, Volker Krummel
SSD
2007
Springer
146views Database» more  SSD 2007»
15 years 10 months ago
Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy
In this paper we propose a fundamental approach to perform the class of Nearest Neighbor (NN) queries, the core class of queries used in many of the location-based services, withou...
Ali Khoshgozaran, Cyrus Shahabi
TCC
2007
Springer
86views Cryptology» more  TCC 2007»
15 years 10 months ago
Weakly-Private Secret Sharing Schemes
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...
Amos Beimel, Matthew K. Franklin
« Prev « First page 1281 / 1422 Last » Next »