733 search results - page 85 / 147 » Recommending random walks |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
CN
2007
14 years 9 months ago
2007
— We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly diffe...
PE
2007
Springer
14 years 9 months ago
2007
Springer
The simulation of mobility models such as the random waypoint often cause subtle problems, for example the decay of average speed as the simulation progresses, a difference betwee...
GROUP
2007
ACM
15 years 1 months ago
2007
ACM
We describe the design and evaluation of K-net, a social matching system to help people learn 'who knows what' in an organization by matching people with skills with tho...
181
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We propose a new method for detecting objects such as bags carried by pedestrians depicted in short video sequences. In common with earlier work on the same problem, the method sta...