We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
We present solutions for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols and a bound k...
Convolution y(t) = a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, wh...
Abstract. Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. A reset arc allows a transition to remove all tokens from a certain place when the transi...
H. M. W. Verbeek, Moe Thandar Wynn, Wil M. P. van ...