441 search results - page 12 / 89 » Query expansion using random walk models |
64
Voted
TREC
2008
14 years 11 months ago
2008
This paper presents the CMU submission to the 2008 TREC blog distillation track. Similar to last year's experiments, we evaluate different retrieval models and apply a query ...
ICIP
1995
IEEE
15 years 11 months ago
1995
IEEE
A 3D super-resolution algorithm is proposed below, based on a probabilistic interpretation of the ndimensional version of Papoulis' generalized sampling theorem. The algorith...
102
click to vote
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
This paper addresses the issue of query refinement, which involves reformulating ill-formed search queries in order to enhance relevance of search results. Query refinement typica...
116
click to vote
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...