Sciweavers

865 search results - page 45 / 173
» Random graph models for the web graph
Sort
View
TKDE
2012
207views Formal Methods» more  TKDE 2012»
13 years 2 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
FOCS
1993
IEEE
15 years 3 months ago
Simulated Annealing for Graph Bisection
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
Mark Jerrum, Gregory B. Sorkin
WWW
2009
ACM
16 years 11 days ago
Unsupervised query categorization using automatically-built concept graphs
Automatic categorization of user queries is an important component of general purpose (Web) search engines, particularly for triggering rich, query-specific content and sponsored ...
Eustache Diemert, Gilles Vandelle
WAIM
2010
Springer
14 years 10 months ago
A Model for Automatic Generation of Multi-partite Graphs from Arbitrary Data
In this paper we propose a generic model to generate basic multi-partite graphs obtained by associations found in arbitrary data. The interest of such a model is to be the formal ...
Ricardo A. Baeza-Yates, Nieves R. Brisaboa, Josep-...
FSEN
2009
Springer
15 years 6 months ago
The Complexity of Reachability in Randomized Sabotage Games
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
Dominik Klein, Frank G. Radmacher, Wolfgang Thomas