751 search results - page 72 / 151 » The Distinguishing Chromatic Number |
VMV
2004
15 years 17 days ago
2004
In this paper we describe methods to efficiently visualize multiple intersecting volumetric objects. We introduce the concept of V-Objects. V-Objects repbstract properties of an o...
SIP
2003
15 years 17 days ago
2003
We describe the establishment of a compound object model for object recognition purposes which provides the frame for the extraction of object structure from images degraded by no...
IQ
2000
15 years 17 days ago
2000
Communication is an essential and necessary aspect of professional work in science and business. Besides the traditional face to face communication more and more face-file-face co...
101
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
EOR
2010
14 years 11 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...