Sciweavers

3707 search results - page 376 / 742
» A Simple Technique for Self-Calibration
Sort
View
208
Voted
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 7 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
215
Voted
AFRICACRYPT
2009
Springer
16 years 1 months ago
Breaking KeeLoq in a Flash: On Extracting Keys at Lightning Speed
We present the first simple power analysis (SPA) of software implementations of KeeLoq. Our attack drastically reduces the efforts required for a complete break of remote keyless...
Markus Kasper, Timo Kasper, Amir Moradi, Christof ...
186
Voted
ICS
2007
Tsinghua U.
16 years 1 months ago
Sensitivity analysis for automatic parallelization on multi-cores
Sensitivity Analysis (SA) is a novel compiler technique that complements, and integrates with, static automatic parallelization analysis for the cases when relevant program behavi...
Silvius Rus, Maikel Pennings, Lawrence Rauchwerger
FCT
2005
Springer
16 years 12 days ago
Exact Algorithms for Graph Homomorphisms
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
179
Voted
OOPSLA
2004
Springer
16 years 6 days ago
Transparent proxies for java futures
A proxy object is a surrogate or placeholder that controls access to another target object. Proxies can be used to support distributed programming, lazy or parallel evaluation, ac...
Polyvios Pratikakis, Jaime Spacco, Michael W. Hick...