28 search results - page 6 / 6 » Discrete Random Walks on One-Sided |
WSDM
2009
ACM
14 years 17 days ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
COLT
2008
Springer
13 years 7 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
CGF
2010
13 years 5 months ago
2010
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...