Sciweavers

4451 search results - page 19 / 891
» On Random Ordering Constraints
Sort
View
BIRTHDAY
2012
Springer
13 years 7 months ago
Masking with Randomized Look Up Tables - Towards Preventing Side-Channel Attacks of All Orders
We propose a new countermeasure to protect block ciphers implemented in leaking devices, at the intersection between One-Time Programs and Boolean masking schemes. First, we show t...
François-Xavier Standaert, Christophe Petit...
ECCV
2006
Springer
16 years 1 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...
VLDB
1994
ACM
110views Database» more  VLDB 1994»
15 years 3 months ago
Fast, Randomized Join-Order Selection - Why Use Transformations?
César A. Galindo-Legaria, Arjan Pellenkoft,...
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 1 months ago
Tight lower bounds for selection in randomly ordered streams
Amit Chakrabarti, T. S. Jayram, Mihai Patrascu