1632 search results - page 88 / 327 » Sublinear Time Algorithms for Metric Space Problems |
152
click to vote
CCCG
2003
15 years 5 months ago
2003
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
154
Voted
DEDS
2010
15 years 3 months ago
2010
Abstract-- The problem of optimally controlling the processing rate of tasks in Discrete Event Systems (DES) with hard real-time constraints has been solved in [9] under the assump...
154
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
141
Voted
JOIN
2007
15 years 3 months ago
2007
— One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formul...
142
Voted
MOR
2010
15 years 2 months ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...