2100 search results - page 114 / 420 » Learning to rank on graphs |
194
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
217
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
165
click to vote
WAW
2007
Springer
16 years 15 days ago
2007
Springer
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
168
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estima...
180
click to vote
EPEW
2005
Springer
15 years 12 months ago
2005
Springer
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...