Sciweavers

441 search results - page 4 / 89
» Query expansion using random walk models
Sort
View
ICC
2009
IEEE
155views Communications» more  ICC 2009»
14 years 4 months ago
Modeling Random Walk Search Algorithms in Unstructured P2P Networks with Social Information
—Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algori...
Jing Xie, King-Shan Lui
EUROCOLT
1999
Springer
14 years 2 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
CLEF
2004
Springer
14 years 3 months ago
IR-n r2: Using Normalized Passages
This paper describes the fourth participation of IR-n system (Alicante University) at CLEF conferences. At present conference, we have modified the similarity measure and the que...
Fernando Llopis, Rafael Muñoz, Rafael M. Te...
INFOCOM
2009
IEEE
14 years 4 months ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu
CIKM
2008
Springer
13 years 11 months ago
A latent variable model for query expansion using the hidden markov model
We propose a novel probabilistic method based on the Hidden Markov Model (HMM) to learn the structure of a Latent Variable Model (LVM) for query language modeling. In the proposed...
Qiang Huang, Dawei Song