We develop an algorithm for estimating the values of a vector x Rn over a support S of size k from a randomized sparse binary linear sketch Ax of size O(k). Given Ax and S, we ca...
It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. Since cocomparability g...
Abstract. This paper presents an agent-based, high-level security system for user verification. The system verifies a user's identity by processing data from several low-lever...
Erik Dovgan, Bostjan Kaluza, Tea Tusar, Matjaz Gam...
Sparse signal recovery algorithms utilizing multiple measurement vectors (MMVs) are known to have better performance compared to the single measurement vector case. However, curre...
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
Meritxell Vinyals, Marc Pujol, Juan A. Rodrí...