Sciweavers

441 search results - page 3 / 89
» Query expansion using random walk models
Sort
View
IJAHUC
2008
118views more  IJAHUC 2008»
13 years 9 months ago
Analysis models for unguided search in unstructured P2P networks
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
Bin Wu, Ajay D. Kshemkalyani
ACL
2007
13 years 11 months ago
Statistical Machine Translation for Query Expansion in Answer Retrieval
We present an approach to query expansion in answer retrieval that uses Statistical Machine Translation (SMT) techniques to bridge the lexical gap between questions and answers. S...
Stefan Riezler, Alexander Vasserman, Ioannis Tsoch...
DKE
2007
130views more  DKE 2007»
13 years 9 months ago
Enabling access-privacy for random walk based data analysis applications
Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queuing. These models enable the desc...
Ping Lin, K. Selçuk Candan
MIR
2005
ACM
140views Multimedia» more  MIR 2005»
14 years 3 months ago
Multiple random walk and its application in content-based image retrieval
In this paper, we propose a transductive learning method for content-based image retrieval: Multiple Random Walk (MRW). Its basic idea is to construct two generative models by mea...
Jingrui He, Hanghang Tong, Mingjing Li, Wei-Ying M...
CN
2000
92views more  CN 2000»
13 years 9 months ago
What is this page known for? Computing Web page reputations
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
Davood Rafiei, Alberto O. Mendelzon