1039 search results - page 47 / 208 » Kernels and Regularization on Graphs |
107
Voted
CORR
2010
Springer
15 years 19 days ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
101
Voted
STOC
2005
ACM
16 years 26 days ago
2005
ACM
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
159
click to vote
SIGIR
2011
ACM
14 years 3 months ago
2011
ACM
As the Internet grows explosively, search engines play a more and more important role for users in effectively accessing online information. Recently, it has been recognized that ...
113
click to vote
ICDM
2010
IEEE
14 years 10 months ago
2010
IEEE
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
110
click to vote
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...