In this paper, we propose a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert regular expr...
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Ideally, enterprise administrators could specify fine-grain policies that drive how the underlying switches forward, drop, and measure traffic. However, existing techniques for fl...
Minlan Yu, Jennifer Rexford, Michael J. Freedman, ...
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
Abstract--Packet matching plays a critical role in the performance of many network devices and a tremendous amount of research has already been invested to come up with better opti...