441 search results - page 32 / 89 » Query expansion using random walk models |
SIGMETRICS
2002
ACM
13 years 9 months ago
2002
ACM
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
SDM
2010
SIAM
13 years 11 months ago
2010
SIAM
Many sorts of structured data are commonly stored in a multi-relational format of interrelated tables. Under this relational model, exploratory data analysis can be done by using ...
WWW
2007
ACM
14 years 10 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
TREC
2004
13 years 11 months ago
2004
In the robust track, we mainly tested our passage-based retrieval model with different passage sizes and weighting schemes. In our approach, we used two retrieval models, namely t...