7796 search results - page 144 / 1560 » On Generalized Schur Numbers |
102
Voted
BROADNETS
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— In this paper we analyze the positioning of landmarks in coordinates-based Internet distance prediction approaches with focus on Global Network Positioning (GNP). We sh...
AICCSA
2005
IEEE
15 years 6 months ago
2005
IEEE
A critical issue in multicast communication is how to identify multicast groups. In the Internet, multicast addresses and port numbers distinguish multicast groups from each other...
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...
113
Voted
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...
89
Voted
JCT
2008
15 years 1 months 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...