#### Filter Results:

#### Publication Year

2014

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell +1 other
- ISAAC
- 2015

- Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell +1 other
- CCCG
- 2015

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 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)

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 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)

- Gui Citovsky, Kan Huang, Joseph S B Mitchell
- 2014

In this paper we consider a type of surveillance problem, which has been widely studied. Unlike [1] [2], which only maximize the time an evader is seen until it is first out of a tracker's vision, we try to maximize the total time an evader is seen as it moves on a known trajectory to its destination.

- ‹
- 1
- ›