Sciweavers

197 search results - page 4 / 40
» Answering complex questions with random walk models
Sort
View
CIKM
2010
Springer
13 years 8 months ago
Rank learning for factoid question answering with linguistic and semantic constraints
This work presents a general rank-learning framework for passage ranking within Question Answering (QA) systems using linguistic and semantic features. The framework enables query...
Matthew W. Bilotti, Jonathan L. Elsas, Jaime G. Ca...
WWW
2004
ACM
14 years 10 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit
CIKM
2007
Springer
14 years 4 months ago
SLOQUE: slot-based query expansion for complex questions
Searching answers to complex questions is a challenging IR task. In this paper, we examine the use of query templates with semantic slots to formulate slot-based queries. These qu...
Maggy Anastasia Suryanto, Ee-Peng Lim, Aixin Sun, ...
PODC
2009
ACM
14 years 10 months ago
Randomized mutual exclusion in O(log N / log log N) RMRs
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
Danny Hendler, Philipp Woelfel
AOSD
2007
ACM
14 years 1 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen