397 search results - page 30 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
SIROCCO
2004
13 years 9 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...
IPL
2008
13 years 7 months ago
2008
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to red...