ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

On the feasibility of low-rank approximation for personalized PageRank

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: András A. Benczúr Hungarian Academy of Sciences, Eötv&3246;s University, Budapest, Hungary
Károly Csalogány Hungarian Academy of Sciences, Eötv&3246;s University, Budapest, Hungary
Tamás Sarlós Hungarian Academy of Sciences, Eötv&3246;s University, Budapest, Hungary
Published in:
· Proceeding
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
ACM New York, NY, USA ©2005
table of contents ISBN:1-59593-051-5 doi>10.1145/1062745.1062824
On the feasibility of low-rank approximation for personalized PageRank Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 15
· Citation Count: 1


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder