1949 search results - page 209 / 390 » Random graphs on surfaces |
168
Voted
TON
2008
15 years 5 months ago
2008
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
134
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
122
click to vote
ICML
2003
IEEE
16 years 5 months ago
2003
IEEE
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
152
Voted
PPAM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
134
click to vote
ASPDAC
2004
ACM
15 years 10 months ago
2004
ACM
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...