2100 search results - page 175 / 420 » Learning to rank on graphs |
227
click to vote
COMBINATORICA
2010
15 years 1 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
178
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
The leading web search engines have spent a decade building highly specialized ranking functions for English web pages. One of the reasons these ranking functions are effective is...
178
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
The link structure of the Web can be viewed as a massive graph. The preferential attachment model and its variants are well-known random graph models that help explain the evoluti...
187
click to vote
SMA
2003
ACM
15 years 11 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
161
click to vote
ISPAN
2002
IEEE
15 years 11 months ago
2002
IEEE
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...