174 search results - page 32 / 35 » Efficient Compression of Web Graphs |
128
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
Online detection of video clips that present previously unseen events in a video stream is still an open challenge to date. For this online new event detection (ONED) task, existi...
132
click to vote
OPODIS
2004
15 years 2 months ago
2004
Abstract. It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on the...
184
click to vote
ICDE
2000
IEEE
16 years 2 months ago
2000
IEEE
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
102
click to vote
WWW
2009
ACM
16 years 1 months ago
2009
ACM
We tackle the problem of disambiguating entities on the Web. We propose a user-driven scheme where graphs of entities ? represented by globally identifiable declarative artifacts ...
106
click to vote
WWW
2004
ACM
16 years 1 months ago
2004
ACM
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...