The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Architecture description languages are used to describe both the hardware and software architecture of an application, at system-level. The basic software components are intended ...
Erwan Jahier, Nicolas Halbwachs, Pascal Raymond, X...
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
Intranet access has become an essential function for corporate users. At the same time, corporation’s security administrators have little ability to control access to corporate ...
As processor speeds rapidly approach the Giga-Hertz regime, the disparity between process time and memory access time plays an increasing role in the overall limitation of processo...