Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CPC
2011

favoriteEmaildiscussreport

240views Education» more CPC 2011»

Many Random Walks Are Faster Than One

12 years 8 months ago

Many Random Walks Are Faster Than One

Download www.bgu.ac.il

Noga Alon, Chen Avin, Michal Koucký, Gady K

Real-time Traffic

CPC 2011 | Operations Research |

claim paper

Related Content

» Computing Many Faces in Arrangements of Lines and Segments

» Quantum Random Walks Hit Exponentially Faster

» Are Multiple Runs of Genetic Algorithms Better than One

» Fast distributed random walks

» Fast and Exact Topk Search for Random Walk with Restart

» A general approach to simultaneous model fitting and variable elimination in response mode...

» Fast Random Walk Graph Kernel

» Adaptive Random Forest How many experts to ask before making a decision

» Randomwalk based approach to detect clone attacks in wireless sensor networks

Post Info
More Details (n/a)

Added	27 Aug 2011
Updated	27 Aug 2011
Type	Journal
Year	2011
Where	CPC
Authors	Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle

Comments (0)