1397 search results - page 9 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
MSWIM
2006
ACM
14 years 2 months ago
2006
ACM
We present an efficient algorithm to compute the coverage map of a given set of transmitters under interference constraints. That is, we compute the set of points that lie within ...
ICIP
2007
IEEE
14 years 10 months ago
2007
IEEE
Abstract - The proposed algorithm in this work provides superresolution for color images by using a learning based technique that utilizes both generative and discriminant approach...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
CCCG
2006
13 years 9 months ago
2006
In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the o...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...