#### Filter Results:

#### Publication Year

2009

2014

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs. This algorithm has been simplified and adapted to fit the framework of LP-type problems. In this framework we can tackle a number of non-linear problems such as computing the smallest enclosing ball of a set of points in R d. In 2006, it has been shown that the algorithm… (More)

A fundamental problem in wireless sensor networks is to connect a given set of sensors while minimizing the receiver interference. This is modeled as follows: each sensor node corresponds to a point in R d and each transmission range corresponds to a ball. The receiver interference of a sensor node is defined as the number of transmission ranges it lies in.… (More)

- ‹
- 1
- ›