Sciweavers

188 search results - page 8 / 38
» Web question answering: is more always better
Sort
View
CIKM
2007
Springer
14 years 1 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, ...
ENASE
2011
219views Hardware» more  ENASE 2011»
12 years 7 months ago
Mutation Selection: Some Could be Better than All
In previous research, many mutation selection techniques have been proposed to reduce the cost of mutation analysis. After a mutant subset is selected, researchers could obtain a t...
Zhiyi Zhang, Dongjiang You, Zhenyu Chen, Yuming Zh...
WWW
2009
ACM
14 years 8 months ago
Learning to recognize reliable users and content in social media with coupled mutual reinforcement
Community Question Answering (CQA) has emerged as a popular forum for users to pose questions for other users to answer. Over the last few years, CQA portals such as Naver and Yah...
Jiang Bian, Yandong Liu, Ding Zhou, Eugene Agichte...
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 9 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
STACS
2007
Springer
14 years 1 months ago
The Complexity of Unions of Disjoint Sets
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
Christian Glaßer, Alan L. Selman, Stephen D....