Learn More
Let P = {C 1 , C 2 ,. .. , C n } be a set of color classes, where each color class C i consists of a set of points. In this paper , we address a family of covering problems, in which one is allowed to cover at most one point from each color class. We prove that the problems in this family are NP-complete (or NP-hard) and offer several constant-factor(More)
We introduce the SINR k model, which is a practical version of the SINR (signal to interference plus noise ratio) model. In the SINR k model, in order to determine whether s's signal is received at c, where s is a sender and c is a receiver, one only considers the k most significant senders w.r.t. to c (other than s). Assuming uniform power, these are the k(More)
In this paper we study a natural special case of the Traveling Salesman Problem (TSP) with point-locational-uncertainty which we will call the adversarial TSP problem (ATSP). Given a metric space (X, d) and a set of subsets R = {R1, R2, ..., Rn} : Ri ⊆ X, the goal is to devise an ordering of the regions, σR, that the tour will visit such that when a single(More)
Citation: Citovsky G and Focardi S (2015) A novel view of suprathreshold stochastic resonance and its applications to financial markets. We introduce an original application of Suprathreshold Stochastic Resonance (SSR). Given a noise-corrupted signal, we induce SSR in effort to filter the effect of the corrupting noise. This will yield a clearer version of(More)
We consider the fundamental problem of scheduling data mules for managing a wireless sensor network. A data mule tours around a sensor network and can help with network maintenance such as data collection and battery recharging/replacement. We assume that each sensor has a fixed data generation rate and a capacity (upper bound on storage size). If the data(More)
  • 1