7840 search results - page 153 / 1568 » On generalized Ramsey numbers |
103
click to vote
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
110
click to vote
CIKM
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents a cluster validation based document clustering algorithm, which is capable of identifying both important feature words and true model order (cluster number). I...
JCT
2008
15 years 21 days ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
102
Voted
WWW
2005
ACM
16 years 1 months ago
2005
ACM
Recent developments in the area of neural networks provided new models which are capable of processing general types of graph structures. Neural networks are well-known for their ...
75
Voted
IJCNN
2006
IEEE
15 years 6 months ago
2006
IEEE
— We analyze the generalization performance of a student in a model composed of linear perceptrons: a true teacher, ensemble teachers, and the student. Calculating the generaliza...