10 search results - page 2 / 2 » A note on Ramsey numbers with two parameters |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
JGT
2010
13 years 5 months ago
2010
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, deno...
ALT
2002
Springer
14 years 4 months ago
2002
Springer
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
APBC
2003
13 years 8 months ago
2003
The interactions of large molecules with surfaces and with each other are strongly dependent upon their surface, rather than their bulk properties. In addition, the local properti...
ICGI
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...