28 search results - page 3 / 6 » Random graphs in the monadic theory of order |
WWW
2007
ACM
14 years 6 months ago
2007
ACM
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...
ACST
2006
13 years 6 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
SIGIR
2006
ACM
13 years 11 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
KDD
2007
ACM
14 years 5 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
DIMACS
1996
13 years 6 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...