442 search results - page 9 / 89 » Representing Colors as Three Numbers |
COMPGEOM
1996
ACM
14 years 17 days ago
1996
ACM
We provideO(n)-timealgorithmsfor constructingthe following types of drawings of n-vertex 3-connectedplanar graphs: 2D convex grid drawings with (3n) (3n=2) area under the edge L1-...
ICIP
1999
IEEE
14 years 10 months ago
1999
IEEE
Autocorrelation and cross-correlation have been defined and utilized in signal and image processing for many years, but not for color or vector images. In this poster we present f...
AAIM
2009
Springer
14 years 3 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
COMGEO
2000
ACM
13 years 8 months ago
2000
ACM
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
NIPS
2008
13 years 9 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...