15 search results - page 3 / 3 » Approximation Algorithms for Euclidean Group TSP |
TSP
2008
13 years 4 months ago
2008
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
ICCV
2003
IEEE
13 years 10 months ago
2003
IEEE
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
DICTA
2003
13 years 6 months ago
2003
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
STOC
2005
ACM
13 years 10 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...