246 search results - page 26 / 50 » Distance Coloring |
82
Voted
PODC
2009
ACM
15 years 10 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
108
click to vote
ALGOSENSORS
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
85
Voted
DICTA
2003
14 years 11 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 ...
103
click to vote
COCOON
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
TVCG
2010
14 years 8 months ago
2010
—Many visualization applications benefit from displaying content on real-world objects rather than on a traditional display (e.g., a monitor). This type of visualization display ...