Sciweavers

1139 search results - page 135 / 228
» Bounded Ideation Theory
Sort
View
ET
2010
89views more  ET 2010»
13 years 6 months ago
On the Duality of Probing and Fault Attacks
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited at...
Berndt M. Gammel, Stefan Mangard
LICS
2010
IEEE
13 years 6 months ago
Addition-Invariant FO and Regularity
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Nicole Schweikardt, Luc Segoufin
CVPR
2006
IEEE
14 years 10 months ago
The Registration Problem Revisited: Optimal Solutions From Points, Lines and Planes
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...
Carl Olsson, Fredrik Kahl, Magnus Oskarsson
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
14 years 8 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
14 years 5 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor