1132 search results - page 55 / 227 » Similarity Graphs |
JGT
2006
13 years 11 months ago
2006
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...
SEMWEB
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Similarity has become a classical tool for ontology confrontation motivated by alignment, mapping or merging purposes. In the definition of an ontologybased measure one ...
COMBINATORICS
2004
13 years 11 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
CIVR
2007
Springer
14 years 5 months ago
2007
Springer
Ensuring the uniqueness of trademark images and protecting their identities are the most important objectives for the trademark registration process. To prevent trademark infringe...
CVPR
2006
IEEE
15 years 1 months ago
2006
IEEE
Classification with only one labeled example per class is a challenging problem in machine learning and pattern recognition. While there have been some attempts to address this pr...