Sciweavers

199 search results - page 2 / 40
» A large time-aware web graph
Sort
View
WWW
2004
ACM
14 years 6 months ago
The webgraph framework I: compression techniques
Studying Web graphs is often difficult due to their large size. Recently, several proposals have been published about various techniques that allow to store a Web graph in memory ...
Paolo Boldi, Sebastiano Vigna
SIGIR
2008
ACM
13 years 5 months ago
A large time-aware web graph
We describe the techniques developed to gather and distribute in a highly compressed, yet accessible, form a series of twelve snapshot of the .uk web domain. Ad hoc compression
Paolo Boldi, Massimo Santini, Sebastiano Vigna
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
13 years 9 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
EMNLP
2011
12 years 5 months ago
Random Walk Inference and Learning in A Large Scale Knowledge Base
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
Ni Lao, Tom M. Mitchell, William W. Cohen
TKDE
2012
207views Formal Methods» more  TKDE 2012»
11 years 8 months ago
Mining Web Graphs for Recommendations
—As the exponential explosion of various contents generated on the Web, Recommendation techniques have become increasingly indispensable. Innumerable different kinds of recommend...
Hao Ma, Irwin King, Michael R. Lyu