Due to the scale and computational complexity of current simulation codes, metamodels (or surrogate models) have become indispensable tools for exploring and understanding the desi...
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
Pure frequency-based audio fingerprint systems have the capacity of handling very short fingerprints while being highly robust to perturbations such as additive noise or compressi...
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...