Sciweavers

107 search results - page 8 / 22
» Some Applications of Bounds for Designs to the Cryptography
Sort
View
CPAIOR
2007
Springer
14 years 27 days ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
KDID
2004
140views Database» more  KDID 2004»
13 years 8 months ago
Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data
We are designing new data mining techniques on boolean contexts to identify a priori interesting bi-sets (i.e., sets of objects or transactions associated to sets of attributes or ...
Jérémy Besson, Céline Robarde...
ASIACRYPT
2000
Springer
13 years 10 months ago
Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis
In this paper we introduce a structure iterated by the rule A of Skipjack and show that this structure is provably resistant against differential or linear attacks. It is the main ...
Jaechul Sung, Sangjin Lee, Jong In Lim, Seokhie Ho...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 3 months ago
Comparing Prediction Market Structures, With an Application to Market Making
Ensuring sufficient liquidity is one of the key challenges for designers of prediction markets. Various market making algorithms have been proposed in the literature and deployed ...
Aseem Brahma, Sanmay Das, Malik Magdon-Ismail
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
13 years 11 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...