50 search results - page 8 / 10 » Answering Opinion Questions with Random Walks on Graphs |
EDBT
2009
ACM
14 years 5 months ago
2009
ACM
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
ICNS
2009
IEEE
14 years 5 months ago
2009
IEEE
What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is ...
SIAMCOMP
2010
13 years 9 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
CISS
2008
IEEE
2008
IEEE
A lower-bound on the number of rankings required in recommender systems using collaborativ filtering
14 years 5 months ago
— We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classe...
DKE
2002
13 years 10 months ago
2002
Recently, there is an interest in using associations between web pages in providing users with pages relevant to what they are currently viewing. We believe that, to enable intell...