733 search results - page 60 / 147 » Recommending random walks |
SAC
2008
ACM
14 years 9 months ago
2008
ACM
Generating adequate recommendations for newcomers is a hard problem for a recommender system (RS) due to lack of detailed user profiles and social preference data. Empirical evide...
IFIPTM
2009
14 years 7 months ago
2009
In many distributed applications, a party who wishes to make a transaction requires that it has a certain level of trust in the other party. It is frequently the case that the part...
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Tracking across non-overlapping camera views is still an unsolved problem. Appearance is a popular cue that does not work when the views are considerably different. This paper pro...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...