The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...
Machine learning for predicting user clicks in Webbased search offers automated explanation of user activity. We address click prediction in the Web search scenario by introducing...
Ding Zhou, Levent Bolelli, Jia Li, C. Lee Giles, H...
In this work we propose a probabilistic model for generic object classification from raw range images. Our approach supports a validation process in which classes are verified usi...
This paper is to investigate the group behavior patterns of search activities based on Web search history data, i.e., clickthrough data, to boost search performance. We propose a ...
Expert search, in which given a query a ranked list of experts instead of documents is returned, has been intensively studied recently due to its importance in facilitating the ne...