203 search results - page 10 / 41 » Random walks on graphs to model saliency in images |
93
Voted
ICDM
2009
IEEE
15 years 7 months ago
2009
IEEE
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
102
Voted
DAGM
2004
Springer
15 years 5 months ago
2004
Springer
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
149
click to vote
TMM
2010
14 years 7 months ago
2010
With the exponential growth of Web 2.0 applications, tags have been used extensively to describe the image contents on the Web. Due to the noisy and sparse nature in the human gene...
94
Voted
ICDM
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
EJC
2007
15 years 9 days ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...