Efficient search ranking in social networks
暂无分享,去创建一个
Berthier A. Ribeiro-Neto | Paulo Braz Golgher | Davi de Castro Reis | Monique V. Vieira | Bruno M. Fonseca | Rodrigo Damazio | B. Ribeiro-Neto | P. B. Golgher | M. V. Vieira | Bruno M. Fonseca | Rodrigo Damazio | D. C. Reis
[1] Raimund Seidel,et al. On the all-pairs-shortest-path problem , 1992, STOC '92.
[2] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[3] Mehran Sahami,et al. Evaluating similarity measures: a large-scale study in the orkut social network , 2005, KDD '05.
[4] Jaana Kekäläinen,et al. Using graded relevance assessments in IR evaluation , 2002, J. Assoc. Inf. Sci. Technol..
[5] Mikkel Thorup,et al. Approximate distance oracles , 2001, JACM.
[6] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[7] Sergey Brin,et al. The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.
[8] Sanjay Ghemawat,et al. MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.
[9] Andrew V. Goldberg,et al. Computing the shortest path: A search meets graph theory , 2005, SODA '05.
[10] David D. Jensen,et al. Using structure indices for efficient approximation of network properties , 2006, KDD '06.
[11] Dorothea Wagner,et al. Combining speed-up techniques for shortest-path computations , 2004, JEAL.
[12] Uri Zwick,et al. All-Pairs Almost Shortest Paths , 1997, SIAM J. Comput..
[13] Uri Zwick,et al. Exact and Approximate Distances in Graphs - A Survey , 2001, ESA.
[14] Cliff Lampe,et al. A face(book) in the crowd: social Searching vs. social browsing , 2006, CSCW '06.