In this paper, we propose a novel approach to expand queries by exploring both location information and topic information of the queries. Users at different locations tend to have...
Shu Huang, Qiankun Zhao, Prasenjit Mitra, C. Lee G...
We propose a new webpage ranking algorithm which is personalized. Our idea is to rely on the attention time spent on a document by the user as the essential clue for producing the...
A recalcitrant problem in approaches to iterated belief revision is that, after first revising by a formula and then by a formula that is inconsistent with the first formula, all ...
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...