Sciweavers

548 search results - page 28 / 110
» Global value numbering using random interpretation
Sort
View
FSE
2007
Springer
115views Cryptology» more  FSE 2007»
15 years 4 months ago
Improving the Security of MACs Via Randomized Message Preprocessing
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...
Yevgeniy Dodis, Krzysztof Pietrzak
IJIIDS
2010
136views more  IJIIDS 2010»
14 years 4 months ago
Kleisli category and database mappings
Abstract. This paper presents the semantics of database mappings in the relational database (DB) category, based on the power-view monad T and monadic algebras. The semantics can b...
Zoran Majkic, Bhanu Prasad
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
14 years 11 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
ICSE
2008
IEEE-ACM
15 years 10 months ago
ARTOO: adaptive random testing for object-oriented software
Intuition is often not a good guide to know which testing strategies will work best. There is no substitute for experimental analysis based on objective criteria: how many bugs a ...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
WINE
2009
Springer
155views Economy» more  WINE 2009»
15 years 4 months ago
Bidding for Representative Allocations for Display Advertising
Display advertising has traditionally been sold via guaranteed contracts – a guaranteed contract is a deal between a publisher and an advertiser to allocate a certain number of ...
Arpita Ghosh, Randolph Preston McAfee, Kishore Pap...