253 search results - page 15 / 51 » Random Walks with Look-Ahead in Scale-Free Random Graphs |
107
click to vote
PODC
2009
ACM
16 years 10 days ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
ICML
2007
IEEE
16 years 18 days ago
2007
IEEE
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...
JCT
2007
14 years 11 months ago
2007
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
118
click to vote
ECML
2006
Springer
15 years 3 months ago
2006
Springer
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
COLING
2010
14 years 6 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...