Sciweavers

406 search results - page 22 / 82
» Pseudorandomness and Combinatorial Constructions
Sort
View
CORR
2012
Springer
218views Education» more  CORR 2012»
13 years 6 months ago
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
Shahar Dobzinski, Jan Vondrák
ICPR
2006
IEEE
16 years 6 days ago
Combinatorial Surface Integration
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...
Edwin R. Hancock, Roberto Fraile
ICCAD
2007
IEEE
115views Hardware» more  ICCAD 2007»
15 years 8 months ago
Timing optimization by restructuring long combinatorial paths
—We present an implementation of an algorithm for constructing provably fast circuits for a class of Boolean functions with input signals that have individual starting times. We ...
Jürgen Werber, Dieter Rautenbach, Christian S...
DNA
2004
Springer
111views Bioinformatics» more  DNA 2004»
15 years 4 months ago
Combinatorial Aspects of Minimal DNA Expressions
We describe a formal language/notation for DNA molecules that may contain nicks and gaps. The elements of the language, DNA expressions, denote formal DNA molecules. Different DNA...
Rudy van Vliet, Hendrik Jan Hoogeboom, Grzegorz Ro...
LATINCRYPT
2010
14 years 9 months ago
Generic Attacks on Misty Schemes
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
Valérie Nachef, Jacques Patarin, Joana Treg...