441 search results - page 24 / 89 » Query expansion using random walk models |
CORR
2012
Springer
12 years 5 months ago
2012
Springer
Preferential attachment is a popular model of growing networks. We consider a generalized model with random node removal, and a combination of preferential and random attachment. U...
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
CCR
2004
13 years 9 months ago
2004
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...
SIGIR
2011
ACM
13 years 20 days ago
2011
ACM
The majority of the current information retrieval models weight the query concepts (e.g., terms or phrases) in an unsupervised manner, based solely on the collection statistics. I...
EURONGI
2008
Springer
13 years 11 months ago
2008
Springer
In this paper, we propose a new mobility model as an extension of the random walk model. Our proposal gathers mobility patterns with several degrees of randomness, so that both ran...