36781 search results - page 83 / 7357 » Parameterizing by the Number of Numbers |
DM
2000
13 years 10 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
FOCI
2007
IEEE
14 years 4 months ago
2007
IEEE
The purpose of this paper is to present a new characterization of the set of all intervals (and of the corresponding set of fuzzy numbers). This characterization is based on sever...
GD
2007
Springer
14 years 4 months ago
2007
Springer
We show that computing the crossing number of a graph with a given rotation system is NP-complete. This result leads to a new and much simpler proof of Hlinˇen´y’s result, tha...
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a kquasi-...
ISCAS
2005
IEEE
14 years 3 months ago
2005
IEEE
—Support Vector Machines are emerging as a powerful machine-learning tool. Logarithmic Number Systems (LNS) utilize the property of logarithmic compression for numerical operatio...