1274 search results - page 19 / 255 » Graph lambda theories |
MST
2008
13 years 8 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
ICCS
1997
Springer
14 years 28 days ago
1997
Springer
Users need to be strongly involved in the specification process of network information systems. Characteristics of user-driven specification are described, and process composition ...
ICIP
2008
IEEE
14 years 3 months ago
2008
IEEE
Text segmentation, or named text binarization, is usually an essential step for text information extraction from images and videos. However, most existing text segmentation method...
LION
2009
Springer
14 years 3 months ago
2009
Springer
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...